- Companion
- object
Value members
Inherited methods
Inserts a new key into the set.
Inserts a new key into the set.
- Value Params
- key
the key to insert
- Returns
true
if the key was new to the set,false
if a node with the given key already existed- Inherited from
- Set
Finds the entry with the smallest key which is greater than or equal to the search key.
Finds the entry with the smallest key which is greater than or equal to the search key.
- Value Params
- key
the search key
- Returns
the found entry, or
None
if there is no key greater than or equal to the search key (e.g. the list is empty)- Inherited from
- SkipList
Searches for the Branch of a given key.
Searches for the Branch of a given key.
- Value Params
- key
the key to search for
- Returns
true
if the key is in the list,false
otherwise- Inherited from
- SkipList
Finds the entry with the largest key which is smaller than or equal to the search key.
Finds the entry with the largest key which is smaller than or equal to the search key.
- Value Params
- key
the search key
- Returns
the found entry, or
None
if there is no key smaller than or equal to the search key (e.g. the list is empty)- Inherited from
- SkipList
Returns the first element. Throws an exception if the list is empty.
Returns the first element. Throws an exception if the list is empty.
- Inherited from
- SkipList
Returns the first element, or None
if the list is empty.
Returns the first element, or None
if the list is empty.
- Inherited from
- SkipList
The number of levels in the skip list.
The number of levels in the skip list.
- Inherited from
- SkipList
Finds the right-most key which is greater than or equal to the query key.
Finds the right-most key which is greater than or equal to the query key.
- Value Params
- key
the key to search for
- n
the branch or leaf from which to go down
- Returns
the index to go down (a node whose key is greater than
key
), or-(index+1)
ifkey
was found atindex
- Inherited from
- HASkipList
Finds the nearest item equal or greater than an unknown item from an isomorphic set. The isomorphism is represented by a comparison function which guides the binary search.
Finds the nearest item equal or greater than an unknown item from an isomorphic set. The isomorphism is represented by a comparison function which guides the binary search.
- Value Params
- compare
a function that guides the search. should return -1 if the argument is smaller than the search key, 0 if both are equivalent, or 1 if the argument is greater than the search key. E.g., using some mapping, the function could look like
mapping.apply(_).compare(queryKey)
- Returns
the nearest item, or the maximum item
- Inherited from
- SkipList
Returns the last element. Throws an exception if the list is empty.
Returns the last element. Throws an exception if the list is empty.
- Inherited from
- SkipList
Returns the last element, or None
if the list is empty.
Returns the last element, or None
if the list is empty.
- Inherited from
- SkipList
The maximum gap within elements of each skip level.
The maximum gap within elements of each skip level.
- Inherited from
- SkipList
The minimum gap within elements of each skip level.
The minimum gap within elements of each skip level.
- Inherited from
- SkipList
Removes a key from the set.
Removes a key from the set.
- Value Params
- key
the key to remove
- Returns
true
if the key was found and removed,false
if it was not found- Inherited from
- Set
Reports the number of keys in the skip list (size of the bottom level). This operation may take up to O(n) time, depending on the implementation.
Reports the number of keys in the skip list (size of the bottom level). This operation may take up to O(n) time, depending on the implementation.
- Inherited from
- SkipList