BTW, regarding the implementation. What about using gl_list ?
##
The implementations are:
GL_ARRAY_LIST a growable array
GL_CARRAY_LIST a growable circular array
GL_LINKED_LIST a linked list
GL_AVLTREE_LIST a binary tree (AVL tree)
GL_RBTREE_LIST a binary tree (red-black tree)
GL_LINKEDHASH_LIST a hash table with a linked list
GL_AVLTREEHASH_LIST a hash table with a binary tree (AVL tree)
GL_RBTREEHASH_LIST a hash table with a binary tree (red-black tree)
###
We may use GL_LINKEDHASH_LIST and write wrappers for it (like in the List
Module).
That is what I had in mind. The hash algorithms implemented in gl_list
fit our needs (null-terminated string keys).
--
Jose E. Marchesi <[EMAIL PROTECTED]>
<[EMAIL PROTECTED]>
GNU Spain http://es.gnu.org
GNU Project http://www.gnu.org
