Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] Map + Set
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Diego Olivier Fernandez Pons <Diego.FERNANDEZ_PONS@e...>
Subject: Re: [Caml-list] Map + Set

> I need a functional data structure that has a decent efficiency
> (i.e. not lists) and can represent `sets of named containers' so
> that I can find a container in a set, remove it from the set, update
> it and put it back into the set.

Do you mean the containers will be indexed by a string or a list of
elements (list of char, list of abstract keys) ? If this is the case
what you are looking for is a trie (or lexical tree).

There are many Caml implementation available including JCF's and
various data structures libraries.

I am not sure I understood properly what you meant. Could you give an
example using "union" or "difference" of keys ?

        Diego Olivier

To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: