On Wed, 24 Sep 2014, Beno?t Minisini wrote:
> Le 23/09/2014 21:47, Tobias Boege a ?crit :
> > Also, Benoit: tell me what you think about the interface. I documented
> > everything in the source code (c_trie.c).
> >
>
> The interface seems perfect. It's just the name "Trie" that I find ugly. :-)
>
Le 23/09/2014 21:47, Tobias Boege a écrit :
> Also, Benoit: tell me what you think about the interface. I documented
> everything in the source code (c_trie.c).
>
The interface seems perfect. It's just the name "Trie" that I find ugly. :-)
Another point on the implementation: you should not use m
Le 23/09/2014 21:47, Tobias Boege a écrit :
> Hi,
>
> in revision #6506, I added two classes to gb.data: Trie and TriePrefix.
> Together they implement a Patricia Trie[0] a.k.a. Radix tree a.k.a. Prefix
> tree.
>
> Trie is the data container. It works just like a Collection. TriePrefix can
> be use
Hi,
in revision #6506, I added two classes to gb.data: Trie and TriePrefix.
Together they implement a Patricia Trie[0] a.k.a. Radix tree a.k.a. Prefix
tree.
Trie is the data container. It works just like a Collection. TriePrefix can
be used to limit searches to a common prefix. This way you can s