|
Boost : |
From: Emily Winch (emily_at_[hidden])
Date: 2002-04-18 17:25:13
Andrei Alexandrescu wrote:
> "Emily Winch" <emily_at_[hidden]> wrote in message
> news:3CBE752C.9010702_at_blueumbrella.net...
>
>>I think this is something that we simply don't know yet (OK, to
>>
> remove
>
>>the generalisation: I don't know it yet). Containers that come
>>immediately to my mind as potentially useful are a tree, and an
>>associative container (for making named template parameters out
>>
> of!).
> [snip]
>
> Lists have the "closure property" - they can represent any data
> structure, no matter how complex, just not always efficiently. For
> details you may want to consult SICP.
The "not always efficiently" part of that sounds like sufficient reason
to want to experiment with representing things in other ways.
Emily
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk