sorting a hash table

[cramd2]

I have created a hash table and it works well, but I am having trouble understanding how a hash table sorts the data. The data that is in the hash table is bound to a drop down list, although, I don't find that I have any control of the sorting of the items listed. The hash table seems to work well for this situation that it allows me to enter "text" with corresponding "values".
cramd2

 

[chrissie1]

the hashtable will use compareto to sort the objects so your object should implement icomparable and override compareto the way you like it.



Christiaan Baes
Belgium

"My new site" - Me

 

[cramd2]

chrissie1
I'm new to the hashtable and your suggestion "implement icomparable and override compareto the way you like it" could work, but I'm in the dark on this one. I'll be researching your suggestion, if you have any sites with examples to get me started, it would be helpful!
Thanks for your response!
cramd2

 

[chrissie1]

Here is a good article on collections

http://www.codeproject.com/csharp/dotnetcollections.asp

and this

public class MyObject : ParentObject, IComparable {
...

public int CompareTo(Object obj ) {
    MyObject myObject = (MyObject) obj;
    //priority is a double, which complicates matters, otherwise
    //  return this.priority-myObject.priority works well
    if(this.priority > myObject.priority) {
       return 1;
    } else if(this.priority < myObject.priority) {
       return -1;
    } else {
       return 0;
    }
 }
}

can be found here

http://www.fincher.org/tips/Languages/csharp.shtml

Christiaan Baes
Belgium

"My new site" - Me