Re: [Ocaml-lib-devel] Data Structures

[Amit D. <ad...@Co...>]

> 
> Hi list,
> 
> When reading the PSQueue module, I was wondering if this one has to be in
> the ExtLib. Can an priority-search-queue can be considered "massively used"
> by ocaml developpers ?

    I hope this is not a rhetorical question, because I think the answer
is.... YES!!! :)

> More generally, it would be nice if we could be able
> to create a list of data structures that should be included in the ExtLib.
> The differents data-structures should be differents enough in terms of usage
> and/or complexity so the user can easily pick the one he needs when he have
> to write a program.
> 
> Right now we have :
> * non mutable
>     - caml list
>     - caml set
> * mutable
>     - caml stack
>     - caml arrays (not resizable)
>     - caml hashtables
>     - ref list
>     - resizable arrays
> 
> What should be added ? I think I have a mutable binary tree ( equiv of Set )
> somewhere that should be useful.

    My opinion - the more the merrier ;)  Right now in the extlib in the
Ocaml CDK, there is an implementation for "big" hashtables (conflicts stored
in a balanced tree rather than a linked list) and splay trees.  An
implementation of perfect hashtable would be nice (I have a simple one
lying around... it would be nice if there was a 'C' alternative to the
current hash function to use with perfect hashing, though).  I also have
an implementation of a heap using a resizable array, but I guess PSQueue would
supercede this.

    Some of us actually do use these esoteric data structures!!! ;)


    -Amit