| Package | Description |
|---|---|
| uk.ac.manchester.cs.jfact.datatypes | |
| uk.ac.manchester.cs.jfact.dep | |
| uk.ac.manchester.cs.jfact.kernel |
| Modifier and Type | Method and Description |
|---|---|
DepSet |
DataTypeReasoner.getClashSet()
get clash-set
|
DepSet |
DataTypeSituation.getNType() |
DepSet |
DataTypeSituation.getPType() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
DataTypeReasoner.addDataEntry(boolean positive,
DagTag type,
NamedEntry entry,
DepSet dep) |
boolean |
DataTypeSituation.addInterval(Datatype<R> interval,
DepSet dep)
add restrictions [POS]INT to intervals
|
void |
DataTypeReasoner.reportClash(DepSet dep,
DatatypeClashes reason)
set clash dep-set to DEP, report with given REASON
|
void |
DataTypeReasoner.reportClash(DepSet dep1,
DepSet dep2,
DatatypeClashes reason)
set clash dep-set to DEP, report with given REASON
|
void |
DataTypeSituation.setNType(DepSet t) |
void |
DataTypeSituation.setPType(DepSet type)
set the precense of the PType
|
| Modifier and Type | Method and Description |
|---|---|
static DepSet |
DepSet.create() |
static DepSet |
DepSet.create(DepSet dep) |
static DepSet |
DepSet.create(int i) |
static DepSet |
DepSet.create(org.roaringbitmap.RoaringBitmap delegate) |
static DepSet |
DepSet.plus(DepSet ds1,
DepSet ds2) |
| 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) |
| Modifier and Type | Method and Description |
|---|---|
DepSet |
CWDArray.get(int bp) |
DepSet |
DlCompletionTreeArc.getDep() |
DepSet |
ConceptWDep.getDep() |
DepSet |
DlCompletionTree.getPurgeDep() |
DepSet |
DlCompletionTreeArc.neighbourDepSet(Role pRole) |
| 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
|
DlCompletionTreeArc |
DlCompletionGraph.createLoop(DlCompletionTree node,
Role r,
DepSet dep)
Create an R-loop of NODE wrt dep-set DEP;
|
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;
|
void |
DlCompletionGraph.merge(DlCompletionTree from,
DlCompletionTree to,
DepSet dep,
List<DlCompletionTreeArc> edges)
merge labels; see SHOIN paper for detailed description
|
DlCompletionTree |
DlCompletionTree.resolvePBlocker(DepSet dep) |
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;
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
DlCompletionGraph.nonMergable(DlCompletionTree p,
DlCompletionTree q,
Reference<DepSet> dep) |
boolean |
DlCompletionTree.nonMergable(DlCompletionTree node,
Reference<DepSet> dep)
check if the NODE's and current node's IR are labelled with the same
level
|
| Constructor and Description |
|---|
ConceptWDep(int p,
DepSet dep) |
DlCompletionTreeArc(Role r,
DepSet dep,
DlCompletionTree n) |
Copyright © 2016 The University of Manchester. All rights reserved.