Modifier and Type | Field and Description |
---|---|
protected ISet |
PropCumulative.allTasks |
protected ISet |
SweepCumulFilter.tasksToUSe |
Modifier and Type | Method and Description |
---|---|
void |
TimeCumulFilter.filter(IntVar[] s,
IntVar[] d,
IntVar[] e,
IntVar[] h,
IntVar capa,
ISet tasks) |
void |
SweepHeiSortCumulFilter.filter(IntVar[] s,
IntVar[] d,
IntVar[] e,
IntVar[] h,
IntVar capa,
ISet tasks) |
void |
SweepCumulFilter.filter(IntVar[] s,
IntVar[] d,
IntVar[] e,
IntVar[] h,
IntVar capa,
ISet tasks) |
void |
NRJCumulFilter.filter(IntVar[] s,
IntVar[] d,
IntVar[] e,
IntVar[] h,
IntVar capa,
ISet tasks) |
void |
DisjunctiveTaskIntervalFilter.filter(IntVar[] s,
IntVar[] d,
IntVar[] e,
IntVar[] h,
IntVar capa,
ISet tasks) |
void |
DefaultCumulFilter.filter(IntVar[] s,
IntVar[] d,
IntVar[] e,
IntVar[] h,
IntVar capa,
ISet tasks) |
abstract void |
CumulFilter.filter(IntVar[] s,
IntVar[] d,
IntVar[] e,
IntVar[] h,
IntVar capa,
ISet tasks)
Filters the cumulative constraint over the subset of tasks induced by tasks
|
void |
PropCumulative.filter(ISet tasks) |
protected void |
SweepCumulFilter.removeNullDurations(IntVar[] d,
ISet tasks) |
Modifier and Type | Method and Description |
---|---|
ISet |
SetVar.getLB()
Get SetVar Lower Bound : the set of integers that must belong to every solution (i.e. a subset of all solutions)
To iterate over this set, use the following loop:
ISet lbSet = getLB();
for(int i : lbSet){
...
}
This object is read-only.
|
ISet |
SetVar.getUB()
Get SetVar Upper Bound : the set of integers that may belong to a solution (i.e. a superset of all solutions)
To iterate over this set, use the following loop:
ISet ubSet = getUB();
for(int i : ubSet){
...
}
This object is read-only.
|
default ISet |
SetVar.getValue()
Retrieves the current value of the variable if instantiated, otherwise the lower bound (kernel).
|
Modifier and Type | Field and Description |
---|---|
protected ISet |
SetVarImpl.lb |
protected ISet |
SetVarImpl.lbReadOnly |
protected ISet |
SetVarImpl.ub |
protected ISet |
SetVarImpl.ubReadOnly |
Modifier and Type | Method and Description |
---|---|
ISet |
SetVarImpl.getLB() |
ISet |
SetVarImpl.getUB() |
Constructor and Description |
---|
SetVarImpl(String name,
ISet lb,
ISet ub,
Model model)
Creates a set variable, of domain
[lb, ub]
Beware : Use this constructor with caution (domain is directly accessible)
lb and ub should be created properly (e.g. lb subset of ub) and should not be modified externally
Both lb and ub should be backtrackable sets (stored sets): use SetFactory.makeStoredSet to build them |
SetVarImpl(String name,
ISet value,
Model model)
Creates a fixed Set variable, equal to
value
Beware : Use this constructor with caution (domain is directly accessible)
value should be created properly and should not be modified afterward |
Modifier and Type | Field and Description |
---|---|
protected ISet[] |
AbstractLengauerTarjanDominatorsFinder.preds |
protected ISet[] |
AbstractLengauerTarjanDominatorsFinder.succs |
Modifier and Type | Method and Description |
---|---|
ISet |
UndirectedGraph.getNeighOf(int x)
Get neighbors of node x
|
ISet |
UndirectedGraph.getNodes() |
ISet |
IGraph.getNodes() |
ISet |
DirectedGraph.getNodes() |
ISet |
DirectedGraph.getPredOf(int x)
Get predecessors of node x
|
ISet |
UndirectedGraph.getPredOrNeighOf(int x) |
ISet |
IGraph.getPredOrNeighOf(int x)
Get either x's predecessors or neighbors.
|
ISet |
DirectedGraph.getPredOrNeighOf(int x) |
ISet |
DirectedGraph.getSuccOf(int x)
Get successors of node x
|
ISet |
UndirectedGraph.getSuccOrNeighOf(int x) |
ISet |
IGraph.getSuccOrNeighOf(int x)
Get either x's successors or neighbors.
|
ISet |
DirectedGraph.getSuccOrNeighOf(int x) |
Modifier and Type | Class and Description |
---|---|
class |
Set_ReadOnly
Generic read-only view of a set
|
class |
StdSet
Generic backtrable set for trailing
|
Modifier and Type | Method and Description |
---|---|
static ISet |
SetFactory.makeBipartiteSet(int offSet)
Creates a set of integers, based on an offseted bipartite set,
Supports integers greater or equal than
offSet
Optimal complexity |
static ISet |
SetFactory.makeBitSet(int offSet)
Creates a set of integers, based on an offseted BitSet,
Supports integers greater or equal than
offSet |
static ISet |
SetFactory.makeConstantSet(int[] cst)
Creates a fixed set of integers, equal to
cst |
static ISet |
SetFactory.makeConstantSet(int lb,
int ub)
Creates a constant set of integers represented with an interval [lb, ub]
|
static ISet |
SetFactory.makeLinkedList()
Creates a set based on a linked list
appropriate when the set has only a few elements
|
static ISet |
SetFactory.makeRangeSet()
Creates a set based on an ordered list of ranges
|
static ISet |
SetFactory.makeSet(SetType type,
int offSet)
Creates an empty set of integers greater or equal than
offSet |
static ISet |
SetFactory.makeSmallBipartiteSet()
Creates a set of integers, based on an offseted bipartite set, for small sets
(arraylist inside to consume less memory)
|
static ISet |
SetFactory.makeStoredSet(SetType type,
int offSet,
Model model)
Creates a stored set of integers greater or equal than
offSet
Such a set is restored after a backtrack |
Constructor and Description |
---|
Set_ReadOnly(ISet set) |
StdSet(Model model,
ISet set) |
Modifier and Type | Class and Description |
---|---|
class |
Set_BitSet
BitSet implementation for a set of integers
Supports negative numbers when using int... constructor
|
class |
Set_Std_BitSet
BitSet implementation for a set of integers
Supports negative numbers if offset is set properly
|
Modifier and Type | Class and Description |
---|---|
class |
Set_CstInterval
Constant Interval set of the form [min, max]
BEWARE: Cannot add/remove elements
|
class |
Set_FixedArray
Fixed array of integers (cannot add nor remove items)
|
Modifier and Type | Interface and Description |
---|---|
interface |
IntIterableSet
An interface to store a set of values, to be used with
IntVar.removeValues(IntIterableSet, org.chocosolver.solver.ICause) and
IntVar.removeAllValuesBut(IntIterableSet, org.chocosolver.solver.ICause)
Created by cprudhom on 09/07/15. |
Modifier and Type | Class and Description |
---|---|
class |
IntIterableBitSet
An IntIterableBitSet based on a BitSet
Created by cprudhom on 09/07/15.
|
class |
IntIterableRangeSet
Concret implementation of
IntIterableSet wherein values are stored in range set. |
Modifier and Type | Class and Description |
---|---|
class |
Set_LinkedList
LinkedList of m elements
add : O(1)
testPresence: O(m)
remove: O(m)
iteration : O(m)
Created by IntelliJ IDEA.
|
Modifier and Type | Class and Description |
---|---|
class |
Set_Std_Swap
Set of integers based on BipartiteSet implementation
BEWARE : CANNOT BOTH ADD AND REMOVE ELEMENTS DURING SEARCH
(add only or remove only)
add : O(1)
testPresence: O(1)
remove: O(1)
iteration : O(m)
|
class |
Set_Std_Swap2
Set of integers based on BipartiteSet implementation for small sets (arraylist inside)
BEWARE : CANNOT BOTH ADD AND REMOVE ELEMENTS DURING SEARCH
|
class |
Set_Swap
Bipartite set of integers:
add : O(1)
contain: O(1)
remove: O(1)
iteration : O(m)
|
class |
Set_Swap2
Set of integers based on BipartiteSet implementation for small sets (arraylist inside)
BEWARE : CANNOT BOTH ADD AND REMOVE ELEMENTS DURING SEARCH
|
Copyright © 2017. All rights reserved.