Search Results

Search found 32435 results on 1298 pages for 'ordered list'.

Page 332/1298 | < Previous Page | 328 329 330 331 332 333 334 335 336 337 338 339  | Next Page >

• C#: How to gracefully pass multiple conditions to Equals()

  - by Roy

  I'm new to C#, and I'm trying to write a program that selects file types from a FileInfo list. So far I have something along the lines of: List<FileInfo> files = new List<FileInfo>(); IEnumerable<FileInfo> result = files.Where(f=>f.Extension.Equals(".jpg", StringComparison.InvariantCultureIgnoreCase)|| f.Extension.Equals(".gif", StringComparison.InvariantCultureIgnoreCase) ); etc Obviously I'm not happy with this solution, but I don't know how to do this otherwise in a single call. What's the better way to go about it?

  Read the article

• jquery .add() is weird

  - by phil

  Hi folks. Why all elements turn red? I only intend to turn <p> red. <ul> <li>list item 1</li> <li>list item 2</li> <li>list item 3</li> </ul> <p>a paragraph</p> <script> $('li').add('p').css('background-color', 'red'); </script>

  Read the article

• Xcode immediate autocompletion (not only to the next CamelCase)

  - by courteous

  How to make the autocompletion feature return the current suggestion (from "completion list") in full? That is, how not to jump only to the next CamelCase with TAB ... but instead have, say, CTRL + TAB choose the suggestion immediately/in full? Example Having CGPDFStringGetLength selected in the "completion list", one would have to press TAB four (4) times! first TAB get to CGPDF then to CGPDFString then to CGPDFStringGet then to CGPDFStringGetLength It would be nice to have CTRL + TAB (for example) make the above a one-step process.

  Read the article

• How to get this to compile?

  - by ShaChris23

  I have this code which compiles and works as expected: class Right {}; class Left { public: Left& operator = (Right const&) { //... Do something ... return *this; } }; int main() { Right right; Left left; // Assign individual object -- this works left = right; } But now, this one surprises me, I thought the template would work itself out since I already provided the = operator() to the Left class. int main() { ... std::list<Right> rightLst; std::list<Left> leftLst; // Assign a list of objects -- this doesn't compile leftLst = rightLst; } What can I do so that I could convert the rightLst to leftLst conversion in a single line?

  Read the article

• Combining consecutive dates into ranges

  - by Ragha J

  I have a List of objects public class sample { public DateTime Date; public string content; } I want to be able to create a list of new objects public class sampleWithIntervals { public DateTime startDate; public DateTime endDate; public string content; } The sample objects should be grouped into intervals based on the content. The intervals can include only those dates that are included in the original sample list. I dont know how to do this in Linq. Sample data: {"10/1/2013", "x"} {"10/2/2013", "x"} {"10/2/2013", "y"} {"10/3/2013", "x"} {"10/3/2013", "y"} {"10/10/2013", "x"} {"10/11/2013", "x"} {"10/15/2013", "y"} {"10/16/2013", "y"} {"10/20/2013", "y"} This should give me {"10/1/2013","10/3/2013", "x"} {"10/2/2013","10/3/2013", "y"} {"10/10/2013","10/11/2013", "x"} {"10/15/2013","10/16/2013", "y"} {"10/20/2013","10/20/2013", "y"}

  Read the article

• How to interact between GameCanvas and LCDUI elements on J2ME?

  - by Santiago

  The thing is I writing a J2ME program that fisrt of all show a "menu" using graphics interface (GameCanvas) and when the user select one item, I need to setCurrent that item (ex. a List), but when return from the List (it could be because the user push a Command "Menu" Item) I need to show the menu again. The real problem when the menu show again, the keyPressed() listener of gamecanvas object stop working. Basically I have: A Midlet object with: GameCanvas object instance A List object instance I don't understand how that works, I didn't find tutorial that share low and high graphics-level APIs on one Midlet.

  Read the article

• ubuntu automatically remember running applications

  - by solomongaby

  Hello, I disabled automatically remember running applications, but when i login it stars a basic set of applications that are in start-up list. The problem is that it starts 2 sessions of pidgin, although there is only one in the start-up list.

  Read the article

• Order By Problem T-Sql

  - by Nick LaMarca

  I have a sql statement I am using a simple sort such as the following Select numbers From theTable Order By numbers What I get in return is the following 1 11 12 14 2 21 22 23 3 35 37 etc... I want it to be ordered in normal order 1 2 3 4 5 6 etc...

  Read the article

• GROUP BY a date, with ordering by date.

  - by standard

  Take this simple query: SELECT DATE_FORMAT(someDate, '%y-%m-%d') as formattedDay FROM someTable GROUP BY formatterDay This will select rows from a table with only 1 row per date. How do I ensure that the row selected per date is the earliest for that date, without doing an ordered subquery in the FROM? Cheers

  Read the article

• python destructuring-bind dictionary contents

  - by Stephen

  Hi, I am trying to 'destructure' a dictionary and associate values with variables names after its keys. Something like params = {'a':1,'b':2} a,b = params.values() but since dictionaries are not ordered, there is no guarantee that params.values() will return values in the order of (a,b). Is there a nice way to do this? Thanks

  Read the article

• Postgresql count+sort performance

  - by invictus

  I have built a small inventory system using postgresql and psycopg2. Everything works great, except, when I want to create aggregated summaries/reports of the content, I get really bad performance due to count()'ing and sorting. The DB schema is as follows: CREATE TABLE hosts ( id SERIAL PRIMARY KEY, name VARCHAR(255) ); CREATE TABLE items ( id SERIAL PRIMARY KEY, description TEXT ); CREATE TABLE host_item ( id SERIAL PRIMARY KEY, host INTEGER REFERENCES hosts(id) ON DELETE CASCADE ON UPDATE CASCADE, item INTEGER REFERENCES items(id) ON DELETE CASCADE ON UPDATE CASCADE ); There are some other fields as well, but those are not relevant. I want to extract 2 different reports: - List of all hosts with the number of items per, ordered from highest to lowest count - List of all items with the number of hosts per, ordered from highest to lowest count I have used 2 queries for the purpose: Items with host count: SELECT i.id, i.description, COUNT(hi.id) AS count FROM items AS i LEFT JOIN host_item AS hi ON (i.id=hi.item) GROUP BY i.id ORDER BY count DESC LIMIT 10; Hosts with item count: SELECT h.id, h.name, COUNT(hi.id) AS count FROM hosts AS h LEFT JOIN host_item AS hi ON (h.id=hi.host) GROUP BY h.id ORDER BY count DESC LIMIT 10; Problem is: the queries runs for 5-6 seconds before returning any data. As this is a web based application, 6 seconds are just not acceptable. The database is heavily populated with approximately 50k hosts, 1000 items and 400 000 host/items relations, and will likely increase significantly when (or perhaps if) the application will be used. After playing around, I found that by removing the "ORDER BY count DESC" part, both queries would execute instantly without any delay whatsoever (less than 20ms to finish the queries). Is there any way I can optimize these queries so that I can get the result sorted without the delay? I was trying different indexes, but seeing as the count is computed it is possible to utilize an index for this. I have read that count()'ing in postgresql is slow, but its the sorting that are causing me problems... My current workaround is to run the queries above as an hourly job, putting the result into a new table with an index on the count column for quick lookup. I use Postgresql 9.2.

  Read the article

• Collectable<T> serialization, Root Namespaces on T in .xml files.

  - by Stacey

  I have a Repository Class with the following method... public T Single<T>(Predicate<T> expression) { using (var list = (Models.Collectable<T>)System.Xml.Serializer.Deserialize(typeof(Models.Collectable<T>), FileName)) { return list.Find(expression); } } Where Collectable is defined.. [Serializable] public class Collectable<T> : List<T>, IDisposable { public Collectable() { } public void Dispose() { } } And an Item that uses it is defined.. [Serializable] [System.Xml.Serialization.XmlRoot("Titles")] public partial class Titles : Collectable<Title> { } The problem is when I call the method, it expects "Collectable" to be the XmlRoot, but the XmlRoot is "Titles" (all of object Title). I have several classes that are collected in .xml files like this, but it seems pointless to rewrite the basic methods for loading each up when the generic accessors do it - but how can I enforce the proper root name for each file without hard coding methods for each one? The [System.Xml.Serialization.XmlRoot] seems to be ignored.

  Read the article

• How can I sync three classes?

  - by TheMachineCharmer

  class Foo { Bar b; List<Foo> Neighbours; } class Bar { Spam s; List<Bar> Neighbours; } class Spam { List<string> Neighbours; } Each of these classes have AddNeighbour,RemoveNeighbour methods. User can add/remove Neighbours from any of the class at random. I want these three objects to be in sync. How can I do this?

  Read the article

• How to build up a lookup table in microcontroller?

  - by GiGi

  Hi, I am so confused about how to build up a 3-dimension lookup table. Is the template as follows: create a 3 dimensional array to store data. Then create linked list. Then create function 'insert' to put all the data into the array? As some book said, linked list should be static const, is it need to create another function to expand the list? Because the lookup table should be used in a microcontroller, it only needs to finish the operation of putting the data into the array and whenever want to find the data, it will be fast and easy to search. Could you help me with that and give me some suggestions? Thank you.

  Read the article

• Union Distinct rows but order them by number of occurrences in mysql

  - by Baversjo

  Hi I have the following query: SELECT o.id,o.name FROM object o WHERE ( o.description LIKE '%Black%' OR o.name LIKE '%Black%' ) UNION ALL SELECT o2.id,o2.name FROM object o2 WHERE ( o2.description LIKE '%iPhone%' OR o2.name LIKE '%iPhone%' ) Which procude the following: id name 2 New Black iPhone 1 New White iPhone 2 New Black iPhone I would like to UNION DISTINCT, but I would also like the result ordered by the number of occurrences of each identical row (primary: id).

  Read the article

• To "null" or not to "null" my class's attributes

  - by Helper Method

  When I write a class in Java, I like to initialize the attributes which are set to a default value directly and attributes which are set by the caller in the constructor, something like this: public class Stack<E> { private List<E> list; private size = 0; public Stack(int initialCapacity) { list = new ArrayList<E>(initialCapacity); } // remainder omitted } Now suppose I have a Tree class: public class Tree<E> { private Node<E> root = null; // no constructor needed, remainder omitted } Shall I set the root attribute to null, to mark that it is set to null by default, or omit the null value?

  Read the article

• jquery toggle+paginate+multiple instances

  - by mark

  Hi, I'm a jquery newbie - wanted to ask what might be the best strategy for achieving what I am after as I think it uses a mix of jquery functions : If list of items exceeds 5 items a 'more' link appears which when toggled will reveal the rest of the items. If items list is 5 or less no 'more' link is shown. Hide button also at bottom of long full revealed list. (perhaps this is toggle+pagination?) And then also that this can be used in multiple instances, as it is for multiple category menu's.(to be used in typical indexhibit websites structure like http://mikeyburton.com/) link 1 link 2 link 3 link 4 link 5 link 6 link 7 link 8 more Any help or links greatly appreciated.

  Read the article

• Nhibernate Bind

  - by user329983

  I have two oracle user defined types: Audit_Type – A normal object with two fields a string and a number Audit_Table_Type – A table of audit_types, (an array) I have a stored procedure that takes as a parameter an Audit_Table_Type. List<Audit_Type> table = new List<Audit_Type>(); var query = session.CreateSQLQuery("call Audit_Rows(Audit_Table_Type(:table))") .SetParameterList("table", table, NHibernateUtil.Custom(typeof(AuditTypeUDT))) This is what I did intuativly created the ICompositeType and just set in a list of them in but this gives me nothing close to what I wanted. I couldn’t figure out how to bind to a table at all. I have built the inline sql that would do this for me but it would destroy my shared pool (not using binds). So a General question how do I bind to complex/composite types using Nhibernate?

  Read the article

• autocomplete issue with iScroll

  - by user1434647

  I am using jQuery Autocomplete on my jQUeryMobile application. It works perfect. Now I'm trying to use iScroll.js to scroll through the list of looked up items. Here is what I'am doing, http://jsfiddle.net/uXbKY/39/ The problem is, iscroll is applying only for the first item of the suggestion box, where as I'm not able to scroll through entire list.Please help me if I'm missing anything in my code.Please help me to acheive this using iScoll. I found one more way that we can use custom touch based scrollbar for autocomplete box http://jsfiddle.net/uXbKY/2/ but there is a issue that, the custom scrollbar appears only for first search and it disappears from the suggastion box when list get refreshed, Please suggest me if we can fix this, because both options are fine for me for using my autocomplete in ipad and android. or if anyone thinks there's a better way to do this than with iScroll and jScrollPane, you are wel-come I'm open to suggestions. Thanks in Advance,

  Read the article

• Filtering subsets using Linq

  - by Nathan Matthews

  Hi All, Imagine a have a very long enunumeration, too big to reasonably convert to a list. Imagine also that I want to remove duplicates from the list. Lastly imagine that I know that only a small subset of the initial enumeration could possibly contain duplicates. The last point makes the problem practical. Basically I want to filter out the list based on some predicate and only call Distinct() on that subset, but also recombine with the enumeration where the predicate returned false. Can anyone think of a good idiomatic Linq way of doing this? I suppose the question boils down to the following: With Linq how can you perform selective processing on a predicated enumeration and recombine the result stream with the rejected cases from the predicate?

  Read the article

• zsh partially completion in aptitude/wajig

  - by mk_cafe

  I'm using wajig to install packages, however when i've changed my shell to zsh it turned out that zsh doesn't list all packages in completion list, for ex. apt-get install octave[TAB] (about 70 completions) but when i try wajig install octave[TAB] or aptitude install octave[TAB] zsh shows only 19 completions other shells i've tested (bash, fish) shows all ~70 completions in all 3 cases. So is there any way to 'fix' this completion in zsh?

  Read the article

• Disambiguating Named Entities in Java

  - by Alterscape

  I have a list of strings (company names, in this case), and a Java program that extracts a list of things that look like company names out of mostly-unstructured text. I need to match each element of extracted text to a string in the list. Caveat: the unstructured text has typos, things like "Blah, Inc." referred to as "Blah," etc. I've tried Levenshtein Edit Distance, but that fails for predictable reasons. Are there known best-practices ways of tackling this problem? Or am I back to manual data-entry?

  Read the article

• F# replace ref variable with something fun

  - by Stephen Swensen

  I have the following F# functions which makes use of a ref variable to seed and keep track of a running total, something tells me this isn't in the spirit of fp or even particular clear on its own. I'd like some direction on the clearest (possible fp, but if an imperative approach is clearer I'd be open to that) way to express this in F#. Note that selectItem implements a random weighted selection algorithm. type WeightedItem(id: int, weight: int) = member self.id = id member self.weight = weight let selectItem (items: WeightedItem list) (rand:System.Random) = let totalWeight = List.sumBy (fun (item: WeightedItem) -> item.weight) items let selection = rand.Next(totalWeight) + 1 let runningWeight = ref 0 List.find (fun (item: WeightedItem) -> runningWeight := !runningWeight + item.weight !runningWeight >= selection) items let items = [new WeightedItem(1,100); new WeightedItem(2,50); new WeightedItem(3,25)] let selection = selectItem items (new System.Random())

  Read the article

• Receive total send and received emails Exchange 2010

  - by Matt

  We are using Exchange 2010. I would like to retrieve a list of total sent emails and received emails from all users in the work place. The list should have all the users' names, then total of sent and received emails. I have tried the code below and tried to change this to no avail. Get-MessageTrackingLog -Recipients [email protected] -start “10/22/2011 00:00:00” -end “11/21/2011 11:59:00” -EventId "receive" | measure-object Get-MessageTrackingLog -sender [email protected] -start “10/22/2011 00:00:00” -end “11/21/2011 11:59:00” -EventId "send" | measure-object

  Read the article

• How to represent a Many-To-Many relationship in XML or other simple file format?

  - by CSharperWithJava

  I have a list management appliaction that stores its data in a many-to-many relationship database. I.E. A note can be in any number of lists, and a list can have any number of notes. I also can export this data to and XML file and import it in another instance of my app for sharing lists between users. However, this is based on a legacy system where the list to note relationship was one-to-many (ideal for XML). Now a note that is in multiple lists is esentially split into two identical rows in the DB and all relation between them is lost. Question: How can I represent this many-to-many relationship in a simple, standard file format? (Preferably XML to maintain backwards compatibility)

  Read the article

< Previous Page | 328 329 330 331 332 333 334 335 336 337 338 339  | Next Page >