From: Kevin Sopp (baraclese_at_[hidden])
Date: 2006-09-18 13:37:53
On 9/18/06, Joaquín Mª López Muñoz <joaquin_at_[hidden]> wrote:
> As it happens, I did in the past a little sketch of how a dynamic
> multi_index_container (no intrusiveness) could be implemented, and
> all of the above coincides with my stuff, except one thing: what is this
> thing and what do you use it for?
It is used to lookup the appropriate sub_node in super_node in constant time
the offset isn't always the same.
I use a minimal perfect hash function so that the sub_node vector doesn't
any space. Its size always equals the number of contained sub_nodes.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk