Hi Everybody,
I would like to create a sorted-data-structure which would enable me to
efficiently
1. insert new elements into it maintaining the sorted-nature of the data
structure.
2. query as to which element is immediately before and after a value that I
present. one can assume that the value
I seem to miss the c++ stl library where it would be trivial to do this!
Sunil.
On Thu, Sep 1, 2011 at 3:43 PM, Sunil S Nandihalli
sunil.nandiha...@gmail.com wrote:
Hi Everybody,
I would like to create a sorted-data-structure which would enable me to
efficiently
1. insert new elements
I really feel sorted-set should have something to achieve what I want .. but
don't seem to find it..
On Thu, Sep 1, 2011 at 3:53 PM, Sunil S Nandihalli
sunil.nandiha...@gmail.com wrote:
I seem to miss the c++ stl library where it would be trivial to do this!
Sunil.
On Thu, Sep 1, 2011 at
On Thu, Sep 1, 2011 at 11:13 AM, Sunil S Nandihalli
sunil.nandiha...@gmail.com wrote:
Hi Everybody,
I would like to create a sorted-data-structure which would enable me to
efficiently
1. insert new elements into it maintaining the sorted-nature of the data
structure.
2. query as to which
Thanks Dave,
That did it. I did not know there was rsubseq .. :)
Thanks
Sunil.
On Thu, Sep 1, 2011 at 4:04 PM, David Powell djpow...@djpowell.net wrote:
On Thu, Sep 1, 2011 at 11:13 AM, Sunil S Nandihalli
sunil.nandiha...@gmail.com wrote:
Hi Everybody,
I would like to create a
Well, the two calls to subseq are unpleasant and possibly slow. I was
thinking there's a way to write it as a single operation that returns
three items, say (subseq s = (dec 50)) to get the items before and
after 50, but of course that doesn't work unless you know 49 is in
there, and in that case
On Thu, Sep 1, 2011 at 2:08 PM, Alan Malloy a...@malloys.org wrote:
Well, the two calls to subseq are unpleasant and possibly slow. I was
thinking there's a way to write it as a single operation that returns
three items, say (subseq s = (dec 50)) to get the items before and
after 50, but of
