|
Boost : |
From: Toon Knapen (toon.knapen_at_[hidden])
Date: 2001-12-08 10:58:05
David Abrahams wrote:
> ----- Original Message -----
> From: "Toon Knapen" <toon.knapen_at_[hidden]>
>
>>>Ok, I understand the problem. May be we'll have to analyze, if and
>>>how it's possible to build a compressed_array with deferred sorting.
>>>BTW aren't others working on array containers with a std::map like
>>>interface already?
>>>
>>
>>who are you thinking of ?
>>
>
> Maybe me.
>
> When I was doing sparse matrix stuff, we needed compressed storage whose
> sort order was determined based on criteria other than the usual ones.
Can I find a reference to this work somewhere (papers, source, ... ? ).
Do you think that this work could provide valuable input for the further
development of ublas ?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk