Darren Cook wrote:
I'm using new/delete currently, but was planning to use boost.Pool once my
design has settled down.
I was considering using some sort of pooling/block allocation method to
improve allocation efficiency, but was leaving that as an optimization
consideration for when I got the
I'm very interested in having tree container concepts in Boost.
The tree_node_map class provides an implementation to a basic tree node
of variable branching size. The implementation here uses the std::map to
implement the children, but this could equally be a std::list,
std::vector or any sui
Rene Rivera wrote:
I'm very interested in having tree container concepts in Boost. It's my
plan
to submit such a thing to Boost in the summer. Currently I only have a
rank_tree implementation (log2 n, or better on all ops) so having someone
else work on other types of tree implementations would b
[2003-03-15] Reece Dunn wrote:
>Is there a library in boost that allows the manipulation of n-ary trees
>(including binary trees and arbitary branching trees as subsets of this).
No. But there was some previous discussion about Kasper Peeters tree
implementation...
http://lists.boost.org/Mail
