Appends all of the elements in the specified Collection to the end of
this list, in the order that they are returned by the specified
Collection's Iterator.
It searches through a subset of right items to find the ones which
can not be fully included without violating the profit requirement
in the knapsack constraint.
Defines an interface of an object which can be plugined into the search right
after executing the consistency function (at the beginning of each search
node).
Increases the capacity of this ArrayList instance, if
necessary, to ensure that it can hold at least the number of elements
specified by the minimum capacity argument.
FIR benchmark (16-point FIR filter)
Source: Kaijie Wu and Ramesh Karri, "Algorithm-Level Recomputing with Shifted
Operands -- A Register Transfer Level Concurrent Error Detection Technique"
IEEE Trans.
FIR16() -
Constructor for class ExamplesJaCoP.FIR16
It constructs an external constraint to enforce that all objects
within Geost constraint are placed within a specified area with
holes in that area specfied as well.
This constructor creates a variable with empty domain (standard
IntervalDomain domain), automatically generated name, and empty attached
constraint list.
It performs search, first by setting up the internal items/attributes of search,
followed later by a call to labeling function with argument specifying the index
of the first not grounded variable.
It executes the program for number of filters,
number of resources (adders, multipliers) and
number of different synthesis techniques (
algorithmic pipelining, multiplier pipelining,
chaining, no special techniques).
It constructs variable comparator with priority based on the minimal value of
domain size divided by the number of constraints currently attached to a variable.
It creates a model where quantity variable is allowed only to be
between 0 and 1, so if the original description allows n items
n copies of that items must be created.
NOINFO -
Static variable in class JaCoP.core.Domain
It specifies the constant responsible of conveying a message that
no information is provided by the domain when describing the change
which has occurred within the domain.
It creates an external constraint to make sure that specified set of objects does not overlap
in k-dimensional space on the given number of selected dimensions within this k-dimensional space.
It creates an external constraint to make sure that specified set of objects does not overlap
in k-dimensional space on the given number of selected dimensions within this k-dimensional space.
It computes a collection of DBoxes that form the same shape, but that are certain
to not overlap
This implementation is probably not the most efficient possible representation.
Given an optimal flow that satisfies all feasibility constraints except
mass balance on two nodes, the parametric simplex algorithm tries to
achieve feasibility while keeping the solution optimal.
Generally speaking, especially in case of multiple arcs between
two nodes and structure constraints imposed on arcs makes it hard
to decompose network flow constraint into primitive ones.
Any constraint may have their own mutable variables which can be register
at store and then store will be responsible for calling appropriate
functions from MutableVar interface to keep the variables consistent with
the search.
Any entity (for example constraints) may have their own mutable variables
(timestamps) which can be register at store and then store will be
responsible for calling appropriate functions from TimeStamp class to
keep the variables consistent with the search.
Some constraints maintain complex data structure based on function
recentDomainPruning of a variable, this function for proper functioning
requires to raise store level after imposition and before any changes to
variables of this constraint occur.
readFile()
Reads a Survo puzzle in the following format
% From http://www.survo.fi/puzzles/280708.txt
% Survo puzzle 128/2008 (1700) #364-35846
A B C D E F
1 * * * * * * 30
2 * * 18 * * * 86
3 * * * * * * 55
22 11 42 32 27 37
It is a state representation which uses a domain representation
to represent all integers which can transition from this state
to the given successor state.
It specifies simple search method based variable order which
takes into account the number of constraints attached to a variable
and lexigraphical ordering of values.
It specifies specific search for the optimal solution search procedure, which
printouts intermediate search results and shows how the search is progressing.
This constructor creates a variable with empty domain (standard
IntervalDomain domain), automatically generated name, and empty attached
constraint list.
It defines an interface of the class which wants to be informed about timeout
occurring during search, as well as the number of solutions found before
timeout has occurred.
Returns an array containing all of the elements in this list in the
correct order; the runtime type of the returned array is that of the
specified array.
toFlow() -
Method in class JaCoP.constraints.netflow.simplex.Arc
It defines an intialize listener which transforms part of the problem
into an extensional constraint by searching for all partial solutions
given the scope of the variables of interest.
TODO prove (or disprove) correctness
TODO can be 'inlined' in updateTree (but that would decrease readability)
Changes the parent of a node and updates the thread data structure (This
operation invalidates the depth values in the subtree)
Runs in O(T2) amortized time over all treeSwaps performed by an
updateTree operation where T2 is the size of the subtree that is being
reversed.
Forward part deletes the outgoing edges of the damaged state and watch whether
the successors are still active (in-degree > 0 ), otherwise we collect it and
continue the loop.
It specifies the limit after which the changed leaves are not
store and the remove level will simply recompute attributes
of all nodes in the knapsack tree.