Module org.chocosolver.solver
Package org.chocosolver.util.objects
-
Interface Summary Interface Description IVal Project: choco-solver.RealInterval -
Class Summary Class Description ArrayVal Project: choco-solver.IntCircularQueue A fix sized circular queue optimized for removing first and last elements.IntList A specific implementation for list of integers.IntMap A specific implementation for hash map of integers wherein all keys and values are greater or equal to 0.MapVal Project: choco-solver.PriorityQueue ShrinkableList<T> Project: choco-solver.StoredIndexedBipartiteSet A 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 StoredIndexedBipartiteSetWithOffset Created by IntelliJ IDEA.StoredSparseSet Implementation 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.