Interface Summary Interface Description IValProject: choco-solver.
Class Summary Class Description ArrayValProject: choco-solver. IntCircularQueueA fix sized circular queue optimized for removing first and last elements. IntListA specific implementation for list of integers. IntMapA specific implementation for hash map of integers wherein all keys and values are greater or equal to 0. MapValProject: choco-solver. PriorityQueue ShrinkableList<T>Project: choco-solver. StoredIndexedBipartiteSetA stored list dedicated to positive integers and three operations : - iteration - removal of an element - check if an element is or not within the list It only requires a StoredInt to denote the first element of the list and proceeds by swapping element with the first one to remove them and incrementing the index of the first element. StoredIndexedBipartiteSet.BipartiteSetIterator StoredIndexedBipartiteSetWithOffsetCreated by IntelliJ IDEA. StoredSparseSetImplementation based on "Maintaining GAC on adhoc r-ary constraints", Cheng and Yap, CP12. ValueSortedMap<E>A map which ensures key uniqueness and order over values.