| Package | Description |
|---|---|
| uk.ac.manchester.cs.jfact.kernel |
| Modifier and Type | Field and Description |
|---|---|
protected List<ConceptWDep> |
DlCompletionTree.inequalityRelation
inequality relation information respecting current node
|
protected Map<Integer,ConceptWDep> |
DlCompletionTree.inequalityRelation_helper |
| Modifier and Type | Method and Description |
|---|---|
ConceptWDep |
CWDArray.getConceptWithBP(int bp) |
ConceptWDep |
CGLabel.getConceptWithBP(int bp) |
| Modifier and Type | Method and Description |
|---|---|
List<ConceptWDep> |
DlCompletionTree.beginl_cc()
begin() iterator for a label with complex concepts
|
List<ConceptWDep> |
DlCompletionTree.beginl_sc()
begin() iterator for a label with simple concepts
|
List<ConceptWDep> |
CGLabel.get_cc() |
List<ConceptWDep> |
CGLabel.get_sc() |
List<ConceptWDep> |
CWDArray.getBase() |
| Modifier and Type | Method and Description |
|---|---|
void |
CGLabel.add(DagTag tag,
ConceptWDep p) |
void |
DlCompletionTree.addConcept(ConceptWDep p,
DagTag tag)
adds concept P to a label, defined by TAG; update blocked status if
necessary
|
void |
DlCompletionGraph.addConceptToNode(DlCompletionTree node,
ConceptWDep c,
DagTag tag)
add concept C of a type TAG to NODE; call blocking check if appropriate
|
void |
ToDoList.addEntry(DlCompletionTree node,
DagTag type,
ConceptWDep C)
add entry with given NODE and CONCEPT with given OFFSET to the Todo table
|
protected void |
CWDArray.private_add(ConceptWDep p)
adds concept P to a label - to be called only from CGLabel
|
Copyright © 2013 The University of Manchester. All Rights Reserved.