Skip to content

How to find nearest key ? #117

Closed Answered by JouriM2
JouriM2 asked this question in Q&A
Discussion options

You must be logged in to vote
 /// <summary>
 /// Seeks the iterator to the position where next item is the key.
 /// If key does not exist,
 /// forward iterator's next item is the first greater item (prefix search forward).
 /// reverse iterator's next item is the last smaller item (prefix search backward).
 /// Complexity: O(log(N))
 /// </summary>
 /// <param name="key">The search key</param>
 void Seek(in TKey key);

Im stupid, sorry

Replies: 1 comment

Comment options

You must be logged in to vote
0 replies
Answer selected by JouriM2
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Category
Q&A
Labels
None yet
1 participant