Package com.google.mu.collect
package com.google.mu.collect
A few useful collections.
Package Specification
The code is developed and tested under Java 8.0.-
ClassDescriptionGeneric binary search algorithm with support for and beyond sorted lists and arrays, in a fluent API.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.BinarySearch.Table<K,
C extends Comparable<C>> Like a hash table, allows looking up comparable values by a key, except the lookup is through binary search instead of hashing.Chain<T>ImmutableList
implementation that supports O(1) concatenation.Deprecated.Please do not use it.InsertionPoint<C extends Comparable<C>>Represents a result ofBinarySearch
.Utilities pertaining toCollection
.Some additional utilities pertaining toIterable
.PrefixSearchTable<K,V> A lookup table that stores prefix (a list of keys of typeK
) -> value mappings.Builder ofPrefixSearchTable
.Selection<T>Parser forSelection
.