AbstractEnvironment.Type type
int currentWorld
ICondition condition
int timestamp
BasicIndexedBipartiteSet booleanSet
IEnvironment environment
IEnvironment environment
boolean currentValue
int timeStamp
IEnvironment environment
double currentValue
int timeStamp
double[] elementData
IStateInt size
IEnvironment environment
IEnvironment environment
int currentValue
int timeStamp
int[] elementData
IStateInt size
IEnvironment environment
IEnvironment environment
long currentValue
int timeStamp
IStoredBoolCopy boolCopy
IStoredIntCopy intCopy
IStoredLongCopy longCopy
IStoredDoubleCopy doubleCopy
StoredOperationCopy operationCopy
StoredIntVectorCopy intVectorCopy
StoredDoubleVectorCopy doubleVectorCopy
StoredObjectCopy objectCopy
IStorage[] copies
int copySize
EnvironmentCopying environment
int timeStamp
Object currentObject
RcBool[] objects
boolean[][] values
int position
RcDouble[] objects
double[][] values
int position
RcDoubleVector[] objects
double[][][] values
int position
int lastSavedWorldIndex
RcInt[] objects
int[][] values
int position
RcIntVector[] objects
int[][][] values
int position
int lastSavedWorldIndex
RcLong[] objects
long[][] values
int position
Operation[] valueStack
int currentLevel
int[] worldStartLevels
int[] list
int[] position
IStateInt last
IEnvironment environment
IStateInt word
IEnvironment environment
IStateLong word
IEnvironment environment
IStateLong[] words
IStateInt wordsInUse
EnvironmentTrailing environment
EnvironmentTrailing
.int worldStamp
int maxWorld
IStorage
can handle.IStoredIntTrail intTrail
IStoredBoolTrail boolTrail
IStoredLongTrail longTrail
IStoredDoubleTrail doubleTrail
IOperationTrail operationTrail
StoredIntVectorTrail intVectorTrail
StoredDoubleVectorTrail doubleVectorTrail
ITrailStorage[] trails
IStorage
trails for
storing different kinds of data.int trailSize
IStoredBoolTrail myTrail
IStoredDoubleTrail myTrail
int[] worldStamps
StoredDoubleVectorTrail myTrail
IStoredIntTrail myTrail
int[] worldStamps
StoredIntVectorTrail myTrail
IStoredLongTrail myTrail
EnvironmentTrailing environment
StoredDoubleVector[] vectorStack
int[] indexStack
double[] valueStack
int[] stampStack
int currentLevel
int[] worldStartLevels
int maxUpdates
EnvironmentTrailing environment
StoredIntVector[] vectorStack
int[] indexStack
int[] valueStack
int[] stampStack
int currentLevel
int[] worldStartLevels
int maxUpdates
Operation[][] operationStack
int curChunk
int nextTop
int[] chunks
int[] tops
StoredBool[][] variableStack
boolean[][] valueStack
int[][] stampStack
int curChunk
int nextTop
int[] chunks
int[] tops
StoredDouble[][] variableStack
double[][] valueStack
int[][] stampStack
int curChunk
int nextTop
int[] chunks
int[] tops
StoredInt[][] variableStack
int[][] valueStack
int[][] stampStack
int curChunk
int nextTop
int[] chunks
int[] tops
StoredLong[][] variableStack
long[][] valueStack
int[][] stampStack
int curChunk
int nextTop
int[] chunks
int[] tops
Operation[] valueStack
int currentLevel
int[] worldStartLevels
StoredBool[] variableStack
boolean[] valueStack
int[] stampStack
int currentLevel
int[] worldStartLevels
StoredDouble[] variableStack
double[] valueStack
int[] stampStack
int currentLevel
int[] worldStartLevels
StoredInt[] variableStack
int[] valueStack
int[] stampStack
int currentLevel
int[] worldStartLevels
StoredLong[] variableStack
long[] valueStack
int[] stampStack
int currentLevel
int[] worldStartLevels
sun.misc.Unsafe unsafe
StoredBool[] variableStack
long valueStack
long stampStack
int currentLevel
int[] worldStartLevels
sun.misc.Unsafe unsafe
StoredDouble[] variableStack
long valueStack
long stampStack
int currentLevel
int[] worldStartLevels
sun.misc.Unsafe unsafe
StoredInt[] variableStack
long valueStack
long stampStack
int currentLevel
int[] worldStartLevels
sun.misc.Unsafe unsafe
StoredLong[] variableStack
long valueStack
long stampStack
int currentLevel
int[] worldStartLevels
Settings settings
ExplanationEngine explainer
FilteringMonitorList eoList
Variable[] vars
int vIdx
Constraint[] cstrs
int cIdx
gnu.trove.map.hash.TIntObjectHashMap<V> cachedConstants
IEnvironment environment
ISearchLoop search
IPropagationEngine engine
IMeasures measures
ISolutionRecorder solutionRecorder
String name
ESat feasible
long creationTime
int id
Constraint TRUE
Constraint FALSE
BoolVar ZERO
BoolVar ONE
SatConstraint minisat
NogoodConstraint nogoods
Ibex ibex
Propagator<V extends Variable>[] propagators
BoolVar boolReif
Constraint opposite
String name
int ID
short state
Operation[] operations
int nbPendingEvt
Propagator<V extends Variable> aCause
PropagatorPriority priority
boolean reactToFineEvt
Constraint constraint
Solver solver
Variable[] vars
int[] vindices
BoolVar bool
Constraint trueCons
Constraint falseCons
int[] indices
PropReif propReif
org.chocosolver.solver.constraints.binary.PropAbsolute.RemProc rem_proc
IIntDeltaMonitor[] idms
IntVar X
IntVar Y
boolean bothEnumerated
Operator operator
int cste
org.chocosolver.solver.constraints.binary.PropDistanceXYC.RemProc remproc
IIntDeltaMonitor[] idms
int[] lval
int cste
PropElement.Sort s
IntVar x
IntVar y
boolean bothEnumerated
IIntDeltaMonitor[] idms
org.chocosolver.solver.constraints.binary.PropEqualX_Y.RemProc rem_proc
int indexToFilter
IntVar x
IntVar y
int cste
boolean bothEnumerated
IIntDeltaMonitor[] idms
org.chocosolver.solver.constraints.binary.PropEqualX_YC.RemProc rem_proc
int indexToFilter
int offSet
IntVar x
IntVar y
int cste
boolean bothEnumerated
IIntDeltaMonitor[] idms
org.chocosolver.solver.constraints.binary.PropEqualXY_C.RemProc rem_proc
int indexToFilter
org.chocosolver.solver.constraints.binary.PropSquare.RemProc rem_proc
IIntDeltaMonitor[] idms
BinRelation relation
IntVar v0
IntVar v1
LargeRelation relation
IStateInt[] supports
int[] blocks
int size
int[] offsets
ValidityChecker valcheck
IStateInt[][] supports
int[] blocks
int arity
int[] offsets
int[][][] tab
ValidityChecker valcheck
int[] supports
int[] blocks
int size
int[] offsets
DisposableValueIterator[] seekIter
int[][] supports
int arity
int[] offsets
int[][][] tab
ValidityChecker valcheck
ValidityChecker valcheck
int arity
int[] offsets
gnu.trove.list.TIntList futureVars
BitSet[] gacValues
int[] nbGacValues
IStateInt last
int[] listuples
gnu.trove.set.TIntSet yes
gnu.trove.set.TIntSet[] sets
StoredSparseSet no
MultivaluedDecisionDiagram MDD
int nvars
int[][] table
org.chocosolver.solver.constraints.extension.nary.PropTableStr2.str2_var[] str2vars
Set_Std_Swap_Array tuples
ArrayList<E> Ssup
ArrayList<E> Sval
boolean firstProp
int n
gnu.trove.map.hash.TIntObjectHashMap<V> tables
int[] lowerbounds
int[] upperbounds
boolean feasible
long[] blocks
int n
BitSet table
int[] lowerbounds
int[] upperbounds
boolean feasible
int[] blocks
int n
UndirectedGraph overlappingBoxes
ISet boxesToCompute
boolean fast
int n
PriorityQueue pQueue
IntVar[] x
IntVar[] y
int[] f
int[] fPrime
int[][] xyGraph
int[] dfsNodes
int[] sccNumbers
int currentSccNumber
int[] tmpArray
int[][] sccSequences
gnu.trove.stack.TIntStack s1
org.chocosolver.solver.constraints.nary.PropSort.Stack2 s2
int[] recupStack
int[] recupStack2
AlgoAllDiffAC filter
Random rd
int period
AlgoAllDiffBC filter
Condition condition
AlgoAllDiffAC filter
Condition condition
int[] values
int nb_vars
IStateBitSet both
IStateInt LB
IStateInt UB
gnu.trove.set.hash.TIntHashSet setValues
IStateInt[] occs
IIntDeltaMonitor[] idms
PropAmongGAC.RemProc rem_proc
boolean needFilter
PropAmongGAC p
int varIdx
int zIdx
StoredValuedDirectedMultiGraph graph
ICostAutomaton cautomaton
gnu.trove.stack.TIntStack toRemove
IStateBool boundChange
int lastWorld
long lastNbOfBacktracks
long lastNbOfRestarts
org.chocosolver.solver.constraints.nary.automata.PropCostRegular.RemProc rem_proc
IIntDeltaMonitor[] idms
gnu.trove.map.hash.TObjectIntHashMap<K> map
int[] lastSp
double lastSpValue
int[] lastLp
double lastLpValue
IntVar[] vs
int offset
IntVar[] z
ICostAutomaton pi
StoredDirectedMultiGraph graph
boolean[] modifiedBound
double[] uUb
double[] uLb
FastPathFinder slp
int nbR
gnu.trove.stack.TIntStack toRemove
gnu.trove.stack.TIntStack[] toUpdateLeft
gnu.trove.stack.TIntStack[] toUpdateRight
gnu.trove.set.hash.TIntHashSet removed
int lastWorld
long lastNbOfBacktracks
long lastNbOfRestarts
gnu.trove.set.hash.TIntHashSet boundUpdate
boolean computed
IIntDeltaMonitor[] idms
org.chocosolver.solver.constraints.nary.automata.PropMultiCostRegular.RemProc rem_proc
double _MCR_DECIMAL_PREC
StoredDirectedMultiGraph graph
IAutomaton automaton
int _num
org.chocosolver.solver.constraints.nary.automata.PropRegular.RemProc rem_proc
IIntDeltaMonitor[] idms
int n
IntProcedure rem_proc
IIntDeltaMonitor idm
int offSet
int minX
int minY
int n
IntVar[] X
IntVar[] Y
org.chocosolver.solver.constraints.nary.channeling.PropInverseChannelAC.RemProc rem_proc
IIntDeltaMonitor[] idms
DirectedGraph connectedGraph
int n
AbstractLengauerTarjanDominatorsFinder domFinder
int offSet
Random rd
CircuitConf conf
int n
int n2
DirectedGraph support
StrongConnectivityFinder SCCfinder
DirectedGraph G_R
int[] sccOf
ISet[] mates
Random rd
int offSet
CircuitConf conf
DirectedGraph connectedGraph
int n
AbstractLengauerTarjanDominatorsFinder domFinder
int offSet
Random rd
int[] rootCandidates
int n
int n2
DirectedGraph support
StrongConnectivityFinder SCCfinder
DirectedGraph G_R
int[] sccOf
ISet[] mates
Random rd
int offSet
BitSet mandSCC
int[] possibleSources
PropSat miniSat
Propagator<V extends Variable> aCause
int nbMaxTasks
int[] sor_array
ArraySort<T> sorter
IntComparator comparator
int[] slb
int[] dlb
int[] eub
int[] hlb
int n
IntVar[] s
IntVar[] d
IntVar[] e
IntVar[] h
IntVar capa
CumulFilter[] filters
ISet allTasks
boolean fast
int awakeningMask
IStateInt lastCapaMax
Cumulative.Filter[] _filters
UndirectedGraph g
ISet tasks
ISet toCompute
long timestamp
Random rd
int maxrd
int[] slb
int[] sub
int[] elb
int[] eub
int[] dlb
int[] hlb
SweepCumulFilter.Event[] events
int nbEvents
int[] map
ISet tasksToUSe
boolean FIXPOINT
gnu.trove.list.array.TIntArrayList temp
gnu.trove.list.array.TIntArrayList tprune
ArraySort<T> sort
Comparator<T> eventComparator
int[] sortedTasks
ArraySort<T> taskSorter
IntComparator comparator
int N
int M
int[][] UB
int[][] LB
boolean strict
IntVar[][] x
PropNogoods nogoods
int n
int n2
DirectedGraph digraph
int[] nodeSCC
BitSet free
UnaryIntProcedure<A> remProc
IIntDeltaMonitor[] idms
StrongConnectivityFinder SCCfinder
int[] father
BitSet in
gnu.trove.map.hash.TIntIntHashMap map
int[] fifo
gnu.trove.list.array.TIntArrayList concernedValues
int n
int[] unusedValues
int[] mate
boolean allEnum
int[] instVals
gnu.trove.list.array.TIntArrayList dVar
int minVal
int maxVal
int nbInst
BitSet valSet
int n
int nbMaxValues
int minValue
int minIndex
int maxIndex
gnu.trove.list.array.TIntArrayList[] bound
gnu.trove.list.array.TIntArrayList stamp
int[] minVal
int[] maxVal
BitSet kerRepresentant
int[] orderedNodes
D D
IntVar[] X
IntVar sum
int n
int min
int max
DirectedGraph connectedGraph
int n
AbstractLengauerTarjanDominatorsFinder domFinder
int offSet
Constraint[] condTrue
Constraint[] condFalse
Constraint original
BoolVar bVar
Constraint trueCons
Constraint falseCons
ReificationConstraint reifCons
int n
int currentSet
ISetDeltaMonitor[] sdm
IntProcedure elementForced
int n
ISetDeltaMonitor[] sdm
IntProcedure elementForced
IntProcedure elementRemoved
IStateInt emptySetIndex
int n
int offSet
BoolVar[] bools
SetVar set
ISetDeltaMonitor sdm
IntProcedure setForced
IntProcedure setRemoved
int nInts
int nSets
int idx
SetVar[] sets
IntVar[] ints
int offSet1
int offSet2
ISetDeltaMonitor[] sdm
IIntDeltaMonitor[] idm
IntProcedure elementForced
IntProcedure elementRemoved
IntProcedure valRem
IntVar iv
SetVar set
ISetDeltaMonitor sdm
IntProcedure elemRem
int k
ISetDeltaMonitor[] sdm
IntProcedure intersectionForced
IntProcedure intersectionRemoved
IntProcedure setForced
IntProcedure setRemoved
int n
int n2
int idx
SetVar[] sets
SetVar[] invsets
SetVar[] toFilter
int offSet1
int offSet2
int offSet
ISetDeltaMonitor[] sdm
IntProcedure elementForced
IntProcedure elementRemoved
IntVar iv
SetVar sv
ISetDeltaMonitor sdm
IntProcedure elemRem
int offSet
int tmp
SetVar tmpSet
IntProcedure forced
IntProcedure removed
ISetDeltaMonitor[] sdm
ISetDeltaMonitor[] sdm
IntProcedure elementForced
IntProcedure elementRemoved
int n
int currentSet
int offSet
ISetDeltaMonitor[] sdm
IntProcedure elementForced
IntProcedure elementRemoved
int k
ISetDeltaMonitor[] sdm
IntProcedure unionForced
IntProcedure unionRemoved
IntProcedure setForced
IntProcedure setRemoved
Operator operator
IntVar var
int[] values
int lb
int ub
IntVar var
int[] values
int lb
int ub
IEventStore eventStore
RuleStore ruleStore
boolean saveCauses
Solver mSolver
ConflictStrategy cstrat
ExplanationEngine mExplainer
Solver mSolver
boolean saveCauses
boolean nogoodFromConflict
PropNogoods ngstore
gnu.trove.list.TIntList ps
Explanation lastExplanation
org.chocosolver.solver.explanations.strategies.DynamicBackTracking.DBTstrategy dbTstrategy
RuleStore mRuleStore
IEventStore mEventStore
ResolutionPolicy policy
boolean strict
Variable objective
boolean intOrReal
double precision
Number bestProvedLB
Number bestProvedUB
int globalLB
int globalUB
int coefLB
int coefUB
IntVar obj
long nbSols
Solver solver
PoolManager<E> pool
boolean firstCall
DecisionOperator<V extends Variable> decOperator
OptimizationPolicy optPolicy
DecisionOperator<V extends Variable> decUB
DecisionOperator<V extends Variable> incLB
IPropagationEngine engine
IEnvironment environment
Solver solver
ArrayList<E> sta_propagators
ArrayList<E> perm_propagators
gnu.trove.list.array.TIntArrayList perm_world
int size
org.slf4j.Logger LOGGER
ContradictionException exception
IEnvironment environment
Solver solver
Propagator<V extends Variable>[] propagators
CircularQueue<E>[] pro_queue
Propagator<V extends Variable> lastProp
IId2AbId p2i
int notEmpty
short[] scheduled
IntCircularQueue[] eventsets
boolean init
int[][] eventmasks
PropagationTrigger trigger
Settings.Idem idemStrat
org.slf4j.Logger LOGGER
Solver solver
ContradictionException exception
IEnvironment environment
Propagator<V extends Variable>[] propagators
short[] match_f
short[] match_c
short max_f
short max_c
IId2AbId p2i
Propagator<V extends Variable> lastProp
int notEmpty
ArrayDeque<E>[] pro_queue_f
boolean[] schedule_f
IntCircularQueue[] event_f
int[][] eventmasks
ArrayDeque<E>[] pro_queue_c
boolean[] schedule_c
PropagatorEventType[] event_c
boolean init
PropagationTrigger trigger
Settings.Idem idemStrat
long max
long current
ICounterAction action
long timelimit
long threshold
long duration
boolean isreached
ICounterAction action
Solver solver
long offset
Solver solver
IEnvironment env
AbstractStrategy<V extends Variable> strategy
boolean stopAtFirstSolution
int rootWorldIndex
int searchWorldIndex
int nextState
int jumpTo
IMeasures measures
boolean hasReachedLimit
boolean hasEndedUnexpectedly
SearchMonitorList smList
ObjectiveManager<V extends Variable,N extends Number> objectivemanager
boolean alive
Decision<V extends Variable> decision
boolean defaultSearch
boolean completeSearch
ExplanationEngine mExplanationEngine
Random random
ArrayList<E> path
BitSet related
BitSet unrelated
BitSet notFrozen
boolean forceCft
boolean isTerminated
double nbFixedVariables
int nbCall
int limit
int level
Decision<V extends Variable> last
ObjectiveManager<V extends Variable,N extends Number> om
IntVar objective
int LB
int UB
gnu.trove.list.array.TIntArrayList clusters
IRestartStrategy geo4cluster
int cluster
gnu.trove.list.array.TIntArrayList tmpDeductions
gnu.trove.set.TIntSet tmpValueDeductions
CircularQueue<E> decisions
PropNogoods png
PropNogoods png
IntVar[] decisionVars
gnu.trove.list.TIntList ps
IRestartStrategy restartStrategy
ICounter restartStrategyLimit
ISearchLoop searchLoop
int restartFromStrategyCount
int restartCutoff
int restartLimit
boolean hasObjective
boolean objectiveOptimal
long solutionCount
long timeCount
long readingTimeCount
long initialisationTimeCount
long initialPropagationTimeCount
long nodeCount
long backtrackCount
long failCount
long restartCount
long maxDepth
long depth
long usedMemory
long startingTime
long startingMemory
Solver solver
Constraint[] cstrs
String name
int scaleFactor
double geometricalFactor
LinkedList<E> solutions
Solver solver
IntVar objective
int lastValue
ResolutionPolicy policy
IntVar[] objectives
int n
int[] vals
int[] lits
PropSat psat
BoolVar[] bvars
private Object readResolve()
int value
DecisionOperator<V extends Variable> assignment
PoolManager<E> poolManager
double value
PoolManager<E> poolManager
int value
DecisionOperator<V extends Variable> operator
PoolManager<E> poolManager
Random rand
Random rand
Solver solver
gnu.trove.map.hash.TIntIntHashMap v2i
IntVar[] vars
double[] A
double[] mA
double[] sA
org.chocosolver.solver.search.strategy.selectors.variables.ActivityBased.IVal[] vAct
BitSet affected
double g
double d
int a
boolean sampling
int nb_probes
int samplingIterationForced
Random random
PoolManager<E> decisionPool
int currentVar
int currentVal
gnu.trove.list.TIntList bests
boolean restartAfterEachFail
IntVar[] variables
FailPerPropagator counter
gnu.trove.map.hash.TIntObjectHashMap<V> pid2ari
gnu.trove.map.hash.TIntIntHashMap pid2arity
gnu.trove.list.TIntList bests
Random random
PoolManager<E> decisionPool
IntValueSelector valueSelector
int aging
double[][] Ilabel
int[] offsets
int split
IStateDouble searchSpaceSize
int currentVar
int currentVal
gnu.trove.list.TIntList bests
Random random
int nodeImpact
PoolManager<E> decisionPool
Solver solver
boolean asgntFailed
boolean learnsAndFails
IntVar lAfVar
long timeLimit
gnu.trove.list.array.TIntArrayList sets
Random random
Variable[] vars
Solver solver
AbstractStrategy<V extends Variable> mainStrategy
boolean active
int nbvar
int[] var2id
long[] timestamps
long failure
BitSet inscope
AbstractStrategy<V extends Variable> find
AbstractStrategy<V extends Variable> prove
Solver solver
Solver solver
org.chocosolver.solver.search.strategy.strategy.GenerateAndTest.GenerateAndTestDecision gAtDec
org.chocosolver.solver.search.strategy.strategy.GenerateAndTest.GenerateAndTestPropagationEngine gAtPE
Operation restorePropagationEngine
int searchSpaceLimit
AbstractStrategy<V extends Variable> mainStrategy
VariableSelector<V extends Variable> variableSelector
IntValueSelector valueSelector
DecisionOperator<V extends Variable> decisionOperator
PoolManager<E> decisionPool
Solver solver
AbstractStrategy<V extends Variable> mainStrategy
boolean active
int nbCV
Variable[] conflictingVariables
VariableSelector<V extends Variable> varselector
RealValueSelector valueIterator
PoolManager<E> decisionPool
PoolManager<E> pool
VariableSelector<V extends Variable> varSelector
SetValueSelector valSelector
DecisionOperator<V extends Variable> operator
AbstractStrategy<V extends Variable>[] strategies
IStateInt index
Thread printer
boolean alive
int[] rem
ICause[] causes
int last
int[] from
int[] to
ICause[] causes
int last
int value
ICause cause
boolean set
IEnumDelta[] delta
IEnumDelta delta
int first
int last
int frozenFirst
int frozenLast
ICause propagator
IIntervalDelta delta
int first
int last
int frozenFirst
int frozenLast
ICause propagator
IEnumDelta delta
boolean used
ICause propagator
int ID
Solver solver
String name
Propagator<V extends Variable>[] propagators
int[] pindices
int pIdx
IView[] views
int vIdx
IVariableMonitor<V extends Variable>[] monitors
int mIdx
int modificationEvents
boolean _plugexpl
boolean reactOnRemoval
int[] values
IStateBitSet indexes
IStateInt LB
IStateInt UB
IStateInt SIZE
int LENGTH
IEnumDelta delta
DisposableValueIterator _viterator
DisposableRangeIterator _riterator
boolean reactOnRemoval
IStateBitSet VALUES
IStateInt LB
IStateInt UB
IStateInt SIZE
int OFFSET
int LENGTH
IEnumDelta delta
DisposableValueIterator _viterator
DisposableRangeIterator _riterator
int offset
int mValue
BasicIndexedBipartiteSet notInstanciated
IEnumDelta delta
boolean reactOnRemoval
DisposableValueIterator _viterator
DisposableRangeIterator _riterator
BoolVar not
boolean isNot
BoolVar not
int constante
IStateBool empty
DisposableValueIterator _viterator
DisposableRangeIterator _riterator
boolean reactOnRemoval
IStateInt LB
IStateInt UB
IStateInt SIZE
IIntervalDelta delta
DisposableValueIterator _viterator
DisposableRangeIterator _riterator
IStateDouble LB
IStateDouble UB
double precision
BoolVar var
BoolVar var
IntVar var
IntDelta delta
DisposableValueIterator _viterator
DisposableRangeIterator _riterator
IntVar var
double precision
IIntDeltaMonitor deltamonitor
ICause propagator
gnu.trove.list.array.TIntArrayList values
org.chocosolver.solver.variables.view.ViewDeltaMonitor.Filler filler
DirectedGraph graph
BitSet restriction
int n
int[] sccFirstNode
int[] nextNode
int[] nodeSCC
int nbSCC
ISet[] successors
int[] stack
int[] p
int[] inf
int[] nodeOfDfsNum
int[] dfsNumOfNode
BitSet inStack
Object[] elements
int size
int cursor
boolean read
gnu.trove.list.array.TIntArrayList values
int idx
DisposableIntIterator iterator
int from
int to
boolean _next
IntVar var
int value
int bound
IntVar var
Object elem
boolean hnext
int[] list
int[] position
IndexedObject[] idxToObjects
IStateInt last
int nlast
int idx
int[] sparse
int[] dense
IStateInt members
int nbLayers
int[] sizes
int[] offsets
int[] mdd
int nextFreeCell
boolean compactOnce
boolean sortTuples
gnu.trove.map.hash.TIntIntHashMap _nodesToRemove
ArrayList<E>[][] _identicalNodes
gnu.trove.list.array.TIntArrayList[][] _nodeId
int _removedCells
int[] _pos
Object[] elementData
int head
int tail
int size
int capacity
ISet set
StoredObjectCopy copies
int current
IStateInt card
int n
EnvironmentTrailing environment
PoolManager<E> operationPoolGC
ISet set
int element
IntCell next
int size
org.chocosolver.util.objects.setDataStructures.linkedlist.Set_2LinkedList.DoubleIntCell first
org.chocosolver.util.objects.setDataStructures.linkedlist.Set_2LinkedList.DoubleIntCell nextCell
org.chocosolver.util.objects.setDataStructures.linkedlist.Set_2LinkedList.DoubleIntCell poolGC
IEnvironment environment
org.chocosolver.util.objects.setDataStructures.linkedlist.Set_Std_2LinkedList.ListOP[] operationPoolGC
int poolCurrentSize
Set_Std_LinkedList_NoRecycling.ListOP[] operationPoolGC
int poolCurrentSize
IEnvironment environment
IStateBool[] elements
IStateInt size
int n
int current
IStateInt size
IEnvironment env
IStateInt size
IEnvironment env
Copyright © 2015. All rights reserved.