|
Boost : |
From: Jeremy Maitin-Shepard (jbms_at_[hidden])
Date: 2004-03-16 23:33:53
This seems like a useful data structure, although I can't think of any
specific use cases.
I am assuming you are implementing it as a balanced binary tree where
you keep track of the number of nodes in the subtree rooted at each
node. (This allows finding a node by its numeric index in time.)
-- Jeremy Maitin-Shepard
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk