Re: [1/3] scrrun: Implement IDictionary_Add and Count (try 2)
On 9 October 2012 11:26, Alistair Leslie-Hughes <leslie_alistair(a)hotmail.com> wrote:
Changelog: scrrun: Implement IDictionary_Add and Count
Actually, does it ever make sense to use a linked list at all to implement a dictionary? It seems to me that if you only ever have a handful of entries a simple array would be better suited, while if you have more than that you'd want some kind of search tree or a hash table.
On 9/10/2012 8:54 PM, Henri Verbeet wrote:
On 9 October 2012 11:26, Alistair Leslie-Hughes <leslie_alistair(a)hotmail.com> wrote:
Changelog: scrrun: Implement IDictionary_Add and Count
Actually, does it ever make sense to use a linked list at all to implement a dictionary? It seems to me that if you only ever have a handful of entries a simple array would be better suited, while if you have more than that you'd want some kind of search tree or a hash table.
I will have a look at some sort of hash table. Best Regards Alistair Leslie-Hughes
On 10/12/2012 09:48, Alistair Leslie-Hughes wrote:
On 9/10/2012 8:54 PM, Henri Verbeet wrote:
On 9 October 2012 11:26, Alistair Leslie-Hughes <leslie_alistair(a)hotmail.com> wrote:
Changelog: scrrun: Implement IDictionary_Add and Count
Actually, does it ever make sense to use a linked list at all to implement a dictionary? It seems to me that if you only ever have a handful of entries a simple array would be better suited, while if you have more than that you'd want some kind of search tree or a hash table.
I will have a look at some sort of hash table. What also could be important is that hash value is visible to user application with get_HashVal(), so in theory we should use compatible hashing algorithm.
Best Regards Alistair Leslie-Hughes
participants (3)
-
Alistair Leslie-Hughes -
Henri Verbeet -
Nikolay Sivov