| java.util.ArrayList mlsub.typing.lowlevel.DomainVector
DomainVector | final class DomainVector extends java.util.ArrayList (Code) | | A DomainVector maintains an upper approximation of the set of solutions of
a constraint. What is handled dynamically : constraints between rigid and
soft variables. Constraints between soft variables are handled in gfp().
RMK: only garbage indexes can have null domains
version: $OrigRevision: 1.9 $, $OrigDate: 1999/10/03 17:37:05 $ author: Alexandre Frey |
Method Summary | |
public int | chooseDomain() Choose a non-null, non-singleton, domain and return its index. | public int | chooseDomain(BitVector set) | public void | clear(int x) | public String | dump() | public void | exclude(int x, BitVector domain) | public void | exclude(int value) | public void | extend() | public Domain | getDomain(int x) | public void | gfp(BitMatrix R, BitMatrix Rt, BitMatrix C, BitMatrix Ct, int[] strategy) Reduce this domain vector to the greatest fixed-point of a constraint. | void | initGfpCardinals() | public void | merge(int src, int dest) | public void | move(int src, int dest) | public void | reduce(int x, boolean unit, BitVector domain) | void | truncate(int x) |
DomainVector | public DomainVector(int offset, int width)(Code) | | |
DomainVector | public DomainVector(int offset, int width, int n)(Code) | | |
chooseDomain | public int chooseDomain()(Code) | | Choose a non-null, non-singleton, domain and return its index. Return -1
if all the domains are instantiated.
|
chooseDomain | public int chooseDomain(BitVector set)(Code) | | ditto but choose a domain whose index i is in set
|
clear | public void clear(int x)(Code) | | |
extend | public void extend()(Code) | | |
gfp | public void gfp(BitMatrix R, BitMatrix Rt, BitMatrix C, BitMatrix Ct, int[] strategy) throws LowlevelUnsatisfiable(Code) | | Reduce this domain vector to the greatest fixed-point of a constraint.
Parameters: R - constraint on the rigid constants (in [0, width[) Parameters: Rt - its transpose Parameters: C - constraint on [0, offset + size()[ Parameters: Ct - its tranpose Parameters: strategy - an iteration strategy: topological sort of C |
initGfpCardinals | void initGfpCardinals()(Code) | | |
move | public void move(int src, int dest)(Code) | | |
truncate | void truncate(int x)(Code) | | |
|
|