From: Hurd, Matthew (hurdm_at_[hidden])
Date: 2003-12-01 23:06:47
> Oh, I'm certain that you could create a policy-based sparse
> vector. In fact, I've been toying with the idea of creating a
> universal policy-based map that can front for both a tree
> implementation and an associative vector implementation (or
> any other implementation that provides a suitable interface,
> such as a hash table, perhaps?). But that requires time that I
> don't have at the moment.
That would be very useful.
As an aside... in addition to this I often find myself creating two
container collections over and over again...
The first is a map and hash_map for ordering and fast look up. The
second being a vector for a fast direct repository and other containers
for lookup / indexing.
There is a container composition / indexing library waiting in those use
cases somewhere wanting to fall out...
I read this mail in the midst of doing what boils down to the second
common usage yet again...
Susquehanna Pacific P/L
IMPORTANT: The information contained in this email and/or its attachments is confidential. If you are not the intended recipient, please notify the sender immediately by reply and immediately delete this message and all its attachments. Any review, use, reproduction, disclosure or dissemination of this message or any attachment by an unintended recipient is strictly prohibited. Neither this message nor any attachment is intended as or should be construed as an offer, solicitation or recommendation to buy or sell any security or other financial instrument. Neither the sender, his or her employer nor any of their respective affiliates makes any warranties as to the completeness or accuracy of any of the information contained herein or that this message or any of its attachments is free of viruses.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk