A few useful collections.
-
Represents the search target that can be found through bisecting the double domain.
Represents the search target that can be found through bisecting the integer domain.
Represents the search target that can be found through bisecting the long integer domain.
Like a hash table, allows looking up comparable values by a key, except the lookup is through
binary search instead of hashing.
A lookup table that stores prefix (a list of keys of type K
) -> value mappings.
An immutable selection of choices for implementing allowlists or denylists,
supporting both
limited
and
unlimited
selections.