1

Topic: Skip List or something another...

All greetings! There was here a necessity for the container, requirements: 1) very fast insertion in the beginning without  2 is necessary) the direct access iterator [] Stopped on Skip List. And like approaches. But, 1) did not find operating implementation, especially in  cases 2) a progarden on storage rather strong (500 000 elements almost 1 storages) Where to look? Or is still  more effective?

2

Re: Skip List or something another...

Hello, Dead Down, you wrote: > There was here a necessity for the container, requirements: > 1) very fast insertion in the beginning without  > 2) the direct access iterator [] Well, generally speaking, is necessary if it is required to interpose only into the beginning it is equivalent to structure in which it is possible to interpose only into the end but at which indexes go upside-down. Well, that is std:: vector from a C ++ quite would approach, if not the requirement about . And so, of course, std:: deque or any other implementation of a deque it is necessary to take simply. If most from zero it is necessary to write, take unrolled list and get auxiliary pointer array on its fragments. > Stopped on Skip List. If specified pair describes all requirements to structure skip list - it is explicit not the most successful choice.

3

Re: Skip List or something another...

> 1) very fast insertion in the beginning without  > 2) the direct access iterator [] std:: vector, push_back (), inverse of indexes v [size-i] is necessary

4

Re: Skip List or something another...

Hello, fin_81, you wrote: _> std:: vector, push_back (), inverse of indexes v size-i ] size-i-1

5

Re: Skip List or something another...

6

Re: Skip List or something another...

7

Re: Skip List or something another...

8

Re: Skip List or something another...

9

Re: Skip List or something another...