Subject: Re: [boost] [ boost ] [ Trie ]
From: Cosmin Boaca (boost.cosmin.boaca_at_[hidden])
Date: 2015-04-03 05:36:28
If your keys are in such a bounded range maybe a VEB tree may be more
suitable . It has O(log log M) complexity on insert operation and if you
have many entries it should work good and be quite space efficient. If it
doesn't suites your needs, maybe I have misunderstood the problem.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk