Hello, I will start implementing this idea. What do you think about the radix tree ? It's even more compact than the idea with the special node. [0] http://en.wikipedia.org/wiki/Radix_tree On 5 May 2015 at 23:02, Antony Polukhin <antoshkka@gmail.com> wrote:
2015-05-04 17:13 GMT+03:00 Cosmin Boaca <boost.cosmin.boaca@gmail.com>:
Hello,
Is it really needed to create a new class called leaf ? I was thinking of storing a vector<key_type> in each node instead of a key_type element and this would handle both cases (one element / more elements) .
Actually, this could be even better for first time. But keep in mind that we'll need to replace vector with something more compact some day.
Also, use boost::container::small_vector<key, 1> instead of std::vector<key>. boost::container::small_vector<key, 1> does not cause dynamic memory allocations for storing a single element.
-- Best regards, Antony Polukhin
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost