Uses of Class
uk.ac.manchester.cs.jfact.dep.DepSet

Packages that use DepSet

Package	Description
uk.ac.manchester.cs.jfact.datatypes
uk.ac.manchester.cs.jfact.dep
uk.ac.manchester.cs.jfact.kernel
uk.ac.manchester.cs.jfact.split

Uses of DepSet in uk.ac.manchester.cs.jfact.datatypes

Methods in uk.ac.manchester.cs.jfact.datatypes that return DepSet

Modifier and Type	Method and Description
DepSet	DataTypeReasoner.getClashSet() get clash-set
DepSet	DataTypeSituation.getNType()
DepSet	DataTypeSituation.getPType()

Methods in uk.ac.manchester.cs.jfact.datatypes with parameters of type DepSet

Modifier and Type	Method and Description
boolean	DataTypeReasoner.addDataEntry(boolean positive, DagTag type, NamedEntry entry, DepSet dep)
boolean	DataTypeSituation.addInterval(boolean pos, Datatype<R> interval, DepSet dep) add restrictions [POS]INT to intervals
void	DataTypeSituation.setNType(DepSet t)
void	DataTypeSituation.setPType(DepSet type) set the precense of the PType

Uses of DepSet in uk.ac.manchester.cs.jfact.dep

Methods in uk.ac.manchester.cs.jfact.dep that return DepSet

Modifier and Type	Method and Description
static DepSet	DepSet.create()
static DepSet	DepSet.create(DepSet dep)
static DepSet	DepSet.create(FastSetSimple delegate)
static DepSet	DepSet.create(int i)
static DepSet	DepSet.plus(DepSet ds1, DepSet ds2)

Methods in uk.ac.manchester.cs.jfact.dep with parameters of type DepSet

Modifier and Type	Method and Description
void	DepSet.add(DepSet toAdd)
static DepSet	DepSet.create(DepSet dep)
static DepSet	DepSet.plus(DepSet ds1, DepSet ds2)

Uses of DepSet in uk.ac.manchester.cs.jfact.kernel

Fields in uk.ac.manchester.cs.jfact.kernel declared as DepSet

Modifier and Type	Field and Description
protected DepSet	DlCompletionTreeArc.depSet dep-set of the arc
protected DepSet	DlCompletionTree.pDep dep-set for Purge op

Methods in uk.ac.manchester.cs.jfact.kernel that return DepSet

Modifier and Type	Method and Description
DepSet	CWDArray.get(int bp)
DepSet	DlCompletionTreeArc.getDep() get dep-set of the edge
DepSet	ConceptWDep.getDep() get dep-set part
DepSet	DlCompletionTree.getPurgeDep() get purge dep-set of a given node

Methods in uk.ac.manchester.cs.jfact.kernel with parameters of type DepSet

Modifier and Type	Method and Description
Restorer	DlCompletionTreeArc.addDep(DepSet dep) add dep-set to an edge; return restorer
void	ConceptWDep.addDep(DepSet d) add dep-set to a CWD
DlCompletionTreeArc	DlCompletionGraph.addRoleLabel(DlCompletionTree from, DlCompletionTree to, boolean isPredEdge, Role R, DepSet dep) add role R with dep-set DEP to the label of the TO arc
protected boolean	DlSatTester.checkDisjointRoleClash(DlCompletionTree from, DlCompletionTree to, Role R, DepSet dep)
DlCompletionTreeArc	DlCompletionGraph.createLoop(DlCompletionTree node, Role r, DepSet dep) Create an R-loop of NODE wrt dep-set DEP; @return a loop edge
DlCompletionTreeArc	DlCompletionGraph.createNeighbour(DlCompletionTree from, boolean isPredEdge, Role r, DepSet dep) Create an empty R-neighbour of FROM;
boolean	DlCompletionTree.initIR(int level, DepSet ds) init IR with given entry and dep-set; @return true if IR already has this label
protected boolean	DlSatTester.initNewNode(DlCompletionTree node, DepSet dep, int C)
boolean	DlCompletionTreeArc.isNeighbour(Role pRole, DepSet dep) same as above; fills DEP with current DEPSET if so
void	DlCompletionGraph.merge(DlCompletionTree from, DlCompletionTree to, DepSet dep, List<DlCompletionTreeArc> edges)
DlCompletionTree	DlCompletionTree.resolvePBlocker(DepSet dep) get node to which current one was merged; fills DEP from pDep's
boolean	DlCompletionGraph.setCurIR(DlCompletionTree node, DepSet ds)
Restorer	DlCompletionTree.setPBlocked(DlCompletionTree blocker, DepSet dep) mark node purged
boolean	DlSatTester.setupEdge(DlCompletionTreeArc pA, DepSet dep, int flags)
List<Restorer>	CWDArray.updateDepSet(DepSet dep)
Restorer	CWDArray.updateDepSet(int index, DepSet dep)
Restorer	DlCompletionTree.updateIR(DlCompletionTree node, DepSet toAdd) update IR of the current node with IR from NODE and additional clash-set; @return restorer

Method parameters in uk.ac.manchester.cs.jfact.kernel with type arguments of type DepSet

Modifier and Type	Method and Description
boolean	DlCompletionGraph.nonMergable(DlCompletionTree p, DlCompletionTree q, Reference<DepSet> dep) Class for maintaining graph of CT nodes.
boolean	DlCompletionTree.nonMergable(DlCompletionTree node, Reference<DepSet> dep) check if the NODE's and current node's IR are labelled with the same level

Constructors in uk.ac.manchester.cs.jfact.kernel with parameters of type DepSet

Constructor and Description
ConceptWDep(int p, DepSet dep) usual c'tor
DlCompletionTreeArc(Role r, DepSet dep, DlCompletionTree n)

Uses of DepSet in uk.ac.manchester.cs.jfact.split

Methods in uk.ac.manchester.cs.jfact.split that return DepSet

Modifier and Type	Method and Description
DepSet	TSplitRules.TSplitRule.fireDep(Set<NamedEntity> CurrentSig, Map<NamedEntity,DepSet> SigDep) calculates dep-set for a rule that can fire, write it to DEP.

Method parameters in uk.ac.manchester.cs.jfact.split with type arguments of type DepSet

Modifier and Type	Method and Description
DepSet	TSplitRules.TSplitRule.fireDep(Set<NamedEntity> CurrentSig, Map<NamedEntity,DepSet> SigDep) calculates dep-set for a rule that can fire, write it to DEP.