de.sciss.lucre.data.HASkipList
Map
Related Docs:
object Map
| package HASkipList
Inserts a new entry into the map.
Inserts a new entry into the map.
the key-value pair to insert
the previous value stored at the key, or None if the key was not in the map
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.
the search key
the found entry, or None if there is no key greater than or equal
to the search key (e.g. the list is empty)
Searches for the Branch of a given key.
Searches for the Branch of a given key.
the key to search for
true if the key is in the list, false otherwise
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.
the search key
the found entry, or None if there is no key smaller than or equal
to the search key (e.g. the list is empty)
Queries the value for a given key.
Queries the value for a given key.
the key to look for
the value if it was found at the key, otherwise None
The number of levels in the skip list.
The number of levels in the skip list.
Finds the nearest item equal or greater than an unknown item from an isomorphic set.
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.
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)
the nearest item, or the maximum item
The maximum gap within elements of each skip level.
The maximum gap within elements of each skip level.
The minimum gap within elements of each skip level.
The minimum gap within elements of each skip level.
The ordering used for the keys of this list.
The ordering used for the keys of this list.
Removes an entry from the map.
Removes an entry from the map.
the key to remove
the removed value which had been stored at the key, or None if the key was not in the map
Reports the number of keys in the skip list (size of the bottom level).
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.