Faster indexed heuristic doubly-linked list to STL?

[Rodion Efremov]

Hello,

I would like to rewrite my fast linked list in Java [1] to C++ and
contribute it to STL. If we allow the operation

    iterator at(size_t index) // runs in Theta(sqrt(N))

the data structure in question can add/remove an element also in total
Theta(sqrt(N)).

What do you think? Can it make it to the library?

Best regards,
rodde

[1] github.com/coderodde/LinkedList