Search Results

Search found 31721 results on 1269 pages for 'adjacency list'.

Page 330/1269 | < Previous Page | 326 327 328 329 330 331 332 333 334 335 336 337  | Next Page >

• string interning - should this code only create 10 strings in memory?

  - by CodingThunder

  Seems to create a lot more. Please advice why or how to intern correctly here. Thanks IList<string> list = new List<string>(10000); for (int i = 0; i < 10000; i++) { for (int k = 0; k < 10; k++) { list.Add(string.Intern(k.ToString())); } } Console.WriteLine("intern Done"); Console.ReadLine();

  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

• What is wrong in this bit of MyID3 code? (error code is just Exceptions)

  - by user3697621

  Okay, so, this was supposed to get the paths of all mp3 files in a folder, read their metadata and put in an arraylist. public static List<String> OrgMetadata(List<String> rawgenrelist){ File folder = new File("C:\\SOM\\"); File[] listOfFiles = folder.listFiles(); //File path = listOfFiles; for (int i = 0; i < listOfFiles.length; i++) { String pt = listOfFiles[i].getAbsolutePath(); File src = new File(pt); MusicMetadataSet src_set = new MyID3().read(src); if (src_set != null && listOfFiles[i].isFile()) { IMusicMetadata metadata = src_set.getSimplified(); rawgenrelist.add(metadata.getGenreName()); } } List<String> genrelist; genrelist = new ArrayList(new HashSet(rawgenrelist)); return genrelist; }

  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

• windows 7 start menu showing incorrect data

  - by madmik3

  Hi, I've tried to rebuild my search index but it does not seem to help. When i search for anything even command I either get an empty list or a list of short cuts with the names Programs Documents Files ... They all have the default white paper icon. If I click on them I get an error message that says Internet security settings prevented one or more files from being opened. Any ideas? thanks

  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

• 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

• 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

• Possibly simple PHP/MYSQL issue with retrieving and showing data

  - by envoys

  I have been racking my brains over this for a while now. Here is the data i have in the sql data base as an example: ID | TYPE | DATA 1 | TXT | TEST 2 | PHP | php 3 | JS | JAVASCRIPT That is just an example, there are multiple listing for TXT, PHP and JS throughout the table. What I want to do is retrive all the data and display it all into separate drop down/select boxes. Meaning, select box one would list all data with type TXT, select box two would list all data with type PHP and select box 3 would list all data with type JS. The only way I have came about doing this is doing individual sql queries for each different type. I know there is a way to do it all in 1 query and then display it the way I want to but I just can't seem to figure out how and I know its going to drive me nuts when someone helps and I see just how they did it. Thanks for the input.

  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

• 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

• 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

• Scala updating/creating value in a hashmap

  - by user1672739

  I don't understand this with Scala hasmaps: How do I create a value or update one if it does not exist? I am tryng to count the number of characters in a list of Strings. I've tried this code but it doesn't work : def times(chars: List[Char]): List[(Char, Int)] = { val map = new HashMap[Char, Int]() chars.foreach( (c : Char) => { map.update(c, map.get(c) + 1) }) } I understand the returning type isn't correct. But is my foreach loop wrong? Is there a prettier way to write it?

  Read the article

• Programmatically get valid switch/case values

  - by craigim

  When MATLAB scans through cases in a switch/case block, does it remember the values that it skips, and is it possible to access that list? I have a few functions with long switch\case block and I would like to have them return a list of valid case values if they make it down to otherwise. For instance, I have a function that returns a set of optical constants for a material. It currently has about 20 different materials and it is growing as I consider new ones. I realize I can brute-force it and just re-type all of the valid cases into a cell array under otherwise and have the function throw an error and return the list of valid responses, but maintaining both lists without errors or laziness creeping in over time is challenging.

  Read the article

• Missing MethodInfo for overloaded function with different return type

  - by Charvak

  I have a class defined as follows interface ITest { List<T> Find<T>(int i); } class Test: ITest { public T List<T> Find<T>(int i) { return default(T); } List<T> ITest.Find<T>(int i) { return null; } } When I use typeof(Test).GetMethods() (both with and without appropriate BindingFlags) I do not get the MethodInfo for ITest.Find function. What is the best way of getting the MethodInfo for the missing method? Thanks

  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

• 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

• 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

• Can someone please clarify the Birthday Effect for me?

  - by Mark

  Please help interpret the Birthday effect as described in Wikipedia: A birthday attack works as follows: Pick any message m and compute h(m). Update list L. Check if h(m) is in the list L. 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

• 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

• Search box inside a div. Django

  - by Juliette Dupuis

  In my django app I display a list of elements (friends name) thanks to a loop: <div> {% for friend in group %} <p>{{ friend.name }} <p> {% endfor %} </div> I would like to create a search box on the top of my list in order to be able to find only the friends the user wants. I would like the search bar does not need to click to send the request (an example is the Airtime searchbox on top of the facebook friends list). I have absolutely no idea on how to do that, and I'm looking for hints or tips to start. Thank you very much for your help.

  Read the article

• Test Redirection with RSpec and Capybara (Rails)

  - by balanv

  I just have learnt how cool RSpec and Cabybara is, and now working around it to learn writing actual test. I am trying to check if after clicking a link, there is a redirection to a specific page. Below is the scenario 1) I have a page /projects/list - I have an anchor with html "Back" and it links to /projects/show Below is the test i wrote in rspec describe "Sample" do describe "GET /projects/list" do it "sample test" do visit "/projects/list" click_link "Back" assert_redirected_to "/projects/show" end end end The test fails with a failure message like below Failure/Error: assert_redirected_to "/projects/show" ArgumentError: @request must be an ActionDispatch::Request Please suggest me on how i should test the redirection and what am i doing wrong?

  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

• 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

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