Search Results

Search found 32044 results on 1282 pages for 'va list'.

Page 339/1282 | < Previous Page | 335 336 337 338 339 340 341 342 343 344 345 346  | Next Page >

  • dynamically build Intersect statement ASP.NET

    - by TDDG
    I would like to use the IEnumerable function Intersect() to combine a few list and get the similar integers from each list. The problem I'm faced with is that I don't know how many list I will need to compare. Here is an example: A{1,2,3,4} B{1,2,3} C{1,2} results = A.Intersect(B).Intersect(C) This works great, but the next time around I may have a D{1,2} next time I come across the function. I'd like to use the Intersect method, but I'm open to new ideas as well.

    Read the article

  • UITableView with multiple selections

    - by NewDev
    I have a UITableView with multiple selections enabled. If I select items and scroll the list back and forth they are remembered and shown and selected (blue background). Using the didDeselectRowAtIndexPath and didSelectRowAtIndexPath I am able to keep my own array of selected items. That part works well. However, if I then use the sectionForSectionIndexTitle and jump to a letter, the selection appears to be forgotten - even indexPathForSelectedRows appears to have been reset and is now empty. My own array remembers that an item is selected and I can set the cell.selected in the cellForRowAtIndexPath but the instant I move the list it is forgotten again. Any ideas? Is this a bug, or how do you retain the selection list when jumping to a letter?

    Read the article

  • JSF selectItem question

    - by DD
    Hi, Is there a way to dynamically create a selectItem list? I dont really want to have to create lots of bean code to make my lists return List<SelectItem>... I tried this: <ice:selectManyCheckbox> <ui:repeat var="product" value="#{productListingService.list}"> <f:selectItem itemLabel="#{product.description}" value="#{product.id}"/> </ui:repeat> </ice:selectManyCheckbox> but it doesnt work. Any ideas?

    Read the article

  • Unix: Search for file contents

    - by Svish
    I find the find . -name "some-file" command very useful to list all files matching some file name in a folder. Is there anything similar I can use to list all files that contains string? If you needed to find all files in a directory that had a certain string of text in it, what would you use?

    Read the article

  • Mysql - Join matches and non-matches

    - by jwzk
    This is related to my other question: http://stackoverflow.com/questions/2579249/managing-foreign-keys I am trying to join the table of matches and non-matches. So I have a list of interests, a list of users, and a list of user interests. I want the query to return all interests, whether the user has the interest or not (should be null in that case), only where the user = x. Every time I get the query working its only matching interests that the user specifically has, instead of all interests whether they have it or not.

    Read the article

  • R: Change the fields' (slots') values of the class assigning a value to some other field

    - by Max Li
    Assgning a value to one field, how can I make the other fields changing. Consider the following R5 class C<-setRefClass("C", fields=list(a="numeric",b="numeric") , methods=list( seta = function(x){ a<<-x b<<-x+10 cat("The change took place!") } ) # end of the methods list ) # end of the class Now create the instance of the class c<-C$new() This command c$seta(10) will result in that c$a is 10 and c$b is 20. So it actually works, however, I want to achieve this result by the command c$a<-10 (i.e. after that I want c$b to be equal to 20 as defined in the class in the logic of seta() function) How can I do it?

    Read the article

  • Manually manipulating ArrayList

    - by jsan
    I have an assignment where I have to create a deque, however I am not allowed to use any built-in classes or interfaces. I am implementing my deque using an array list. My problem is that when I have to, for instance, add to the beginning of the array list (beginning of the queue), i am not allowed to do this: public void addFirst(ArrayList<Integer> array) { array.add(0, int); } Is there a way to do this without using the add() function? Such as manually adding to the front and shifting the rest of the array to the right? Or maybe creating a new array list and copying...I'm not sure. Any help would be great; I have a bunch of functions to write, and getting the first one done will definitely put me in the right direction. Thanks

    Read the article

  • Xcode method navigation

    - by Bill
    In Xcode 4, I can press Ctrl-6 to get a list of all the methods in the current file. The problem is, if I have private methods declared at the top of my implementation file, say: @interface Foo () -(void)tap:(id)sender; @end @implementation Foo ... -(void)tap:(id)sender { ... } then starting to type "tap" while the method list is visible will just take me to the declaration, since it comes first in the file, when what I really want is the implementation. Is there any way to exclude these declarations from the method list or do I need to resort to separate Foo.h and Foo+Private.h headers? Thanks!

    Read the article

  • reading root element in xml not the child

    - by Umesha MS
    Hi I am working on an application which reads XML file. Here I am trying to read the node under the not under the node . When I tried to read the I get both. Please help me to solve the problem. Bellow is the sample. "a" "x"..."/X" "b" "name" 123 "/name" "/b" "name" main "/name" "c".."/c" "/a" QDomDocument mDocument; QDomElement mDocumentElement; if (!mDocument.setContent(file.readAll())) { return ; } mDocumentElement = mDocument.documentElement(); QDomNodeList list = mDocumentElement.elementsByTagName("a").at(0).toElement().elementsByTagName("name"); int count = list.count(); for (int i = 0; i < count; i++) { QString str = list.at(i).nodeValue(); QMessageBox::information(this, "text", str, QMessageBox::Yes, 0); }

    Read the article

  • reterview data from two tables using inner join in cakephp

    - by user3593884
    I two tables from database one as user(id,first_name,last_name) and the second table location(id,country). I need to perform inner join with this two tables and the list should display first_name,last_name,country with condition user.id=location.id I have written sql queries in cakephp $this->set('users',$this->User->find('list', array( 'fields' => array('User.id', 'User.first_name','location.country'), array('joins' => array(array('table' => 'location', 'alias' => 'location', 'type' => 'INNER', 'conditions' => array('User.id = location.id'))))))); i get error -Unknown column 'location.country' in 'field list' Please help!

    Read the article

  • JQuery - How do I count the number of elements selected by a selector?

    - by Josh
    I am using $().fadeOut() to fade items out in a list ( < li < /li). When the list is empty I wish to hide a parent object. I plan on doing this by checking in my trigger event that fades the list if the count of the objects is 0 then hide the parent element. I can use the fadeOut callback to remove the elements if necessary. The to the point question: How do I select li tags inside a ul and then get the total count of them using jquery?

    Read the article

  • C# determining generic type

    - by Chris Klepeis
    I have several templated objects that all implement the same interface: I.E. MyObject<datatype1> obj1; MyObject<datatype2> obj2; MyObject<datatype3> obj3; I want to store these objects in a List... I think I would do that like this: private List<MyObject<object>> _myList; I then want to create a function that takes 1 parameter, being a datatype, to see if an object using that datatype exists in my list.... sorta clueless how to go about this. In Pseudo code it would be: public bool Exist(DataType T) { return (does _myList contain a MyObject<T>?); }

    Read the article

  • Is the FoldLeft function available in R?

    - by JSmaga
    Hi, I would like to know if there is an implementation of the foldLeft function (and foldRight?) in R. The language is supposed to be "rather" functional oriented and hence I think there should be something like this, but I could not find it in the documentation. To me, foldLeft function applies on a list and has the following signature: foldLeft[B](z : B)(f : (B, A) => B) : B It is supposed to return the following result: f(... (f(f(z, a0), a1) ...), an) if the list is [a0, a1, ..., an]. (I use the definition of the Scala List API) Does anybody know if such a function exists in R?

    Read the article

  • out-of-the-box way to get an idmap from hibernate for a given entity?

    - by Geert-Jan
    Over and over again I notive myself getting a list from hibernate, and the first thing next is put it in an idmap like: List<House> entities = s.createCriteria(House.class).list(); Map<String,House> entitymap = new HashMap<String,House>(); for(TA_entity e:entities){ entitymap.put(e.getId(), e); } Is there a way to get this directly out of hibenerate? afterall Hibernate is familiar with the id.

    Read the article

  • LINQ query to navigate an object hierachy

    - by TesterTurnedDeveloper
    Let's say I have an object graph of Countries / States / Cities, like below: public class City { public string Name { get; set; } } public class State { public List<City> Cities { get; set; } } public class Country { public List<State> States { get; set; } } Is there a simple way to query a List<Country> to get all the cities?

    Read the article

  • Write a tree class in Java where each level has a unique object type

    - by user479576
    I need to write a tree class in Java where each level has a unique object type. The way it is written below does not take advantage of generics and causes alot of duplicate code. Is there a way to write this with Generics ? public class NodeB { private String nodeValue; //private List<NodeB> childNodes; // constructors // getters/setters } public class NodeA { private String value; private List<NodeB> childNodes; // constructors // getters/setters } public class Tree { private String value; private List<NodeA> childNodes; // constructors // tree methods }

    Read the article

  • Where to declare variable? C#

    - by user1303781
    I am trying to make an average function... 'Total' adds them, then 'Total' is divided by n, the number of entries... No matter where I put 'double Total;', I get an error message. In this example I get... Use of unassigned local variable 'Total' If I put it before the comment, both references show up as error... I'm sure it's something simple..... namespace frmAssignment3 { class StatisticalFunctions { public static class Statistics { //public static double Average(List<MachineData.MachineRecord> argMachineDataList) public static double Average(List<double> argMachineDataList) { double Total; int n; for (n = 1; n <= argMachineDataList.Count; n++) { Total = argMachineDataList[n]; } return Total / n; } public static double StDevSample(List<MachineData.MachineRecord> argMachineDataList) { return -1; } } } }

    Read the article

  • does jQuery UI have a way to achieve this Flash button's functionality?

    - by Tim
    There's a button in Flash which looks something like a jQuery SplitButton. The Flash button consists of two parts, the text and the icon. [text portion] [v] I have used it to display string search operators for the user: equals, starts with, ends with, contains. In Flash, when the icon is clicked, the text-area drops down a list of choices; it would look like this: [ ] [v] equals starts with ends with contains And when the user makes a choice from the list, the choice is displayed in the text area of the button and the list rolls up. [ starts with ] [v] I'm trying to convert my Flash app and am hoping to come up with a counterpart to this functionality. For space considerations on the form, a radio-button-group would be less than ideal. That's the major virtue of this Flash button -- it's very economical in its use of screen real-estate. Thanks for any answers/suggestions.

    Read the article

  • Definition of "lisp form"?

    - by josh
    Hi, What exactly the definition of a "Lisp form"? As far as I know, it's "either an atom or a list that has a symbol as its first element". But then, this (in Scheme) would not be a form: ((lambda () 42)) ;; The answer to Life, the Universe and Everything. Because the first element of the list is itself another list. And after it's evaluated it will be a procedure (not a symbol). I can find several different websites and tutorials talking about Lisp forms, but none which gives a complete and detailed definition. Where can I find one?

    Read the article

  • Looking for Haskell `group` alternative in F#

    - by Heather
    Haskell group descripted there: http://www.haskell.org/ghc/docs/latest/html/libraries/base/Data-List.html#v:group example : group "Mississippi" = ["M","i","ss","i","ss","i","pp","i"] Is there simple F# way of doing it? I can implement something alike let rec sameCounter (data : list<float>) el same (ss : list<float * int>) = if data.Length > (el + 1) then if data.[el] = data.[el + 1] then sameCounter data (el + 1) <| same + 1 <| ss else if same > 0 then sameCounter data (el + 1) <| 0 <| (data.[el], same) :: ss else sameCounter data (el + 1) <| 0 <| ss else ss let group d = sameCounter d 0 0 [] but it's a bit ugly way I think, is there better variant?

    Read the article

  • Data Structure Brushup (Java)

    - by Daddy Warbox
    This should be easy for many of you, but for me it's just another bit of rust needing to be chipped away as I get back into basic Java coding. Using bloody associative arrays for so long in other languages have turned me nice and spoiled. :P My problem is simple: I'm storing a set of objects, each containing a string and a number, in a list. I would like each object inserted into this list to be sorted alphabetically by its string. I would also like to be able to retrieve objects from the list by their string as well. I would like to do this as formally and/or efficiently as possible. Is there something already available in the Java standard libraries for this?

    Read the article

  • Birthday effect - clarification needed plz.

    - by Mark
    Please help interpret the Birthday effect as described in Wikipedia: A birthday attack works as follows: 1) Pick any message m and compute h(m). 2) Update list L. Check if h(m) is in the list L. 3) if (h(m),m) is already in L, a colliding message pair has been found. else save the pair (h(m),m) in the list L and go back to step 1. From the birthday paradox we know that we can expect to find a matching entry, after performing about 2^(n/2) hash evaluations. Does the above mean 2^(n/2) iterations through the above entire loop (i.e. 2^(n/2) returns to step 1), OR does it mean 2^(n/2) comparisons to individual items already in L.

    Read the article

  • return only one document for each filter defined in the query

    - by Garytxo
    Hi all, In one of my latest projects I use Solr 1.4 for searching products.However I have ran into a slight problem, which I aint sure if its possible to do using Solr. All products are indexed by "country" and "category" and the "id", "class" and "description" are stored values. I now have been requested to extract a sample list of products that we have for a give "category" and "ONLY RETURNING ONE" product for each country where the product is available. In my current implementation, I have a dismax query to get a list of all the countries that correspond to the catergory, then I call again solr to extract all products for each country, limiting the no. rows by the size of the countries found in the previous query. The problem I have with this current implementation is I can not be certain that I have one product for each country in the list. Therefore would anyone know if it possible to tell solr that you want only one product per country provided in the query? Any guidance would be useful.

    Read the article

  • Can I have an android activity run only on the first time an application is opened?

    - by The Trav
    OK, so I'm playing around with an android app. The 90% use case is that users want to go straight to the primary list screen to find what they're looking for. That's what I want as my default screen. The first time a user loads the app however, some configuration is required before their list screen is of any value to them. So my question, is how I can go about displaying the configuration activity the first time the app is opened up, and then the list screen for future openings. I also want to put a demo button on the configuration screen, so I suppose more than just detecting that it's the first time, I specifically want to detect whether the user has performed certain configurations within the first screen.

    Read the article

< Previous Page | 335 336 337 338 339 340 341 342 343 344 345 346  | Next Page >