Boost logo

Boost :

From: Sam Schetterer (samthecppman_at_[hidden])
Date: 2007-03-21 19:36:33

On 3/21/07, Corrado Zoccolo <czoccolo_at_[hidden]> wrote:
> Hi Sam,
> I see sorting problems and sorted data structures as two faces of the
> same medal.
> In STL, for example, we have std::sort and std::set that both work
> with a two way comparison functor (std::less).
> I see a great potential in your work on operator[] with trie data
> structures.
> I think that an organic proposal of radix_sort with trie data
> structures (mimicking std::set and std::map), that both use the same
> operator[] approach would be very interesting.
> Corrado
> --

What do you mean when you say that? Do you mean that data would first be
sorted by element value, and then all equal elements would be sorted by key?
I am not sure that I understand what you are getting at, but the basic idea
sounds pretty good.

Boost list run by bdawes at, gregod at, cpdaniel at, john at