hashtable

In .NET you can select a hashtable as type for a usersetting. However when I save it and retrieve it in this way, it doesnt seem to have saved it at all. Hashtable t = new Hashtable(); t.Add(1,"Foo"); t.Add(2,"Bar"); Properties.Settings.Default.Setting = t; Properties.Settings.Default.Save(); if(Properties.Settings.Default.Setting != null) foreach (DictionaryEntry entry in Properties.Settings.Default.Setting) { MessageBox.Show(entry.Key + " " + entry.Value); } Why doesnt it serialize it in the usersettings, when I can clearly select that type in Visual studio? I would understand if this was

I need to use hashtable of mutable variable in Ocaml, but it doesn't work out. let link = Hashtbl.create 3;; let a = ref [1;2];; let b = ref [3;4];; Hashtbl.add link a b;; # Hashtbl.mem link a;; - : bool = true # a := 5::!a;; - : unit = () # Hashtbl.mem link a;; - : bool = false Is there any way to make it works? Mutable variables that may happen to have the same content can still be distinguished because they are stored at different locations in memory. They can be compared with the physical equality operator ( == ). However, OCaml doesn't provide anything better than equality, it doesn't

the 'Equal' and 'GetHashcode' method are exist in the object class, and our type inherit the object base class. what's the different between implement the two methods of the object directly and using the IComparer interface? if we overriding object's Equal and GetHashCode , and push to a hashtable , it will use the overring 's equal method? what' the differents of new a hashtable with the IEqualityComparer constructor? The IComparable interface is used when you need to be able to "sort" objects, and it gives you a method ( CompareTo ) that tells you if two objects are <, = or > . The

I am looking for a way to maintain the insert order for a Hash that I am using in Ruby. My data is coming from a database and is already grouped/ordered the way I want it, but Ruby doesn't guarantee maintained order in Hashs in my version 1.8.4 . Is there any workaround for this? If not is there a way I could create a custom comparator? Here is the Hash: { "February"=>[0.5667, 14.6834, 79.7666, 261.8668, 342.1167, 723.517], "March"=>[0.0, 26.4667, 554.45, 681.3164, 2376.0668, 10353.0358], "May"=>[2.75, 34.6666, 342.1831, 1331.8999, 1589.617, 9282.9662], "July"=>[1.9, 2.3666, 59.45, 302.1501,

I know the basic principle of the hash table data structure. If I have a hash table of size N, I have to distribute my data into these N buckets as evenly as possible. But in reality, most languages have their built-in hash table types. When I use them, I don't need to know the size of hash table beforehand. I just put anything I want into it. For example, in Ruby : h = {} 10000000.times{ |i| h[i]=rand(10000) } How can it do this? svick See the Dynamic resizing section of the Hash table article on Wikipedia . The usual approach is to use the same logic as a dynamic array : have some number of