|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object | +--cgp.runtime.Type | +--cgp.runtime.GraphType
Field Summary | |
static notio.CopyingScheme |
COPYING_SCHEME
|
static notio.CopyingScheme |
COPYING_SCHEME_NO_COMMENTS
|
private KBase |
kbase
|
static notio.MatchingScheme |
MATCH_EXACT
|
static notio.MatchingScheme |
MATCH_SUBGRAPH
|
private notio.Graph |
value
|
Fields inherited from class cgp.runtime.Type |
kbStack,
scopeStack,
type |
Constructor Summary | |
GraphType(java.io.File f)
|
|
GraphType(notio.Graph g)
|
|
GraphType(notio.Relation r)
|
|
GraphType(java.lang.String s)
|
Method Summary | |
Type |
add(GraphType extraGraph)
Add to a copy of this graph and return it. |
private boolean |
areConceptsCompatible(notio.Concept[] c1,
notio.Concept[] c2)
Are the specified concepts type compatible? Note that this does not mean that they are necessarily restriction compatible. |
boolean |
areDesignatorsEquivalent(notio.Graph other)
Check designator and marker equivalence together by iterating over each concept's designator (which consists of a literal, marker, or name) and testing pCG value equivalence. |
private boolean |
areRelationsCompatible(notio.Relation r1,
notio.Relation r2)
Is the first conceptual relation supertype compatible with the second? For this to be true, the first's relation must be the same type or a supertype of the second, and the same must hold for each concept argument of the two conceptual relations. |
boolean |
containsActorNodes()
Does this graph contain one or more actor relations? This asks nothing about the validity of any such actors, a task carried out at pCG actor definition time. |
GraphType |
copy()
Make a copy of this graph. |
Type |
eqOp(Type other)
|
boolean |
equals(java.lang.Object other)
|
ListType |
getActors()
Returns a list of lists each of which is headed by a actor name, followed by a list of input concepts, and a list of output concepts. |
ListType |
getConcepts()
Returns a list of all concepts in this graph. |
KBase |
getKBase()
|
ListType |
getRelations()
Returns a list of lists each of which is headed by a relation name, followed by a list of input concepts, and a list of output concepts. |
notio.Graph |
getValue()
|
notio.Graph |
join(notio.Graph g)
Attempt to join the specified graph onto this one. |
Type |
join(GraphType g)
Join operation. |
notio.Graph |
joinAtHead(notio.Graph g)
Attempt to join the specified graph onto this one at their heads. |
Type |
joinAtHead(GraphType g)
Join at head concepts operation. |
GraphType |
nocomments()
Make a copy of this graph without comments. |
notio.Graph |
parseGraph(java.lang.Object o)
|
notio.Graph |
project(notio.Graph filter)
Project the specified graph onto this graph, returning the projection as a new graph, or null. |
Type |
project(GraphType filterGraph)
Project the specified graph onto this graph, returning the projection as a new graph, or undefined. |
java.lang.String |
toString()
|
Methods inherited from class cgp.runtime.Type |
addOp,
andOp,
divideOp,
geOp,
getAttr,
getKBStack,
getNthOp,
getScopeStack,
getType,
gtOp,
invokeMemberFunc,
isOp,
leOp,
ltOp,
modulusOp,
multiplyOp,
negateOp,
neOp,
notOp,
operationError,
orOp,
setAttr,
setKBStack,
setNthOp,
setScopeStack,
setType,
subtractOp |
Methods inherited from class java.lang.Object |
|
Field Detail |
public static notio.CopyingScheme COPYING_SCHEME
public static notio.CopyingScheme COPYING_SCHEME_NO_COMMENTS
public static notio.MatchingScheme MATCH_EXACT
public static notio.MatchingScheme MATCH_SUBGRAPH
private notio.Graph value
private KBase kbase
Constructor Detail |
public GraphType(notio.Graph g)
public GraphType(java.lang.String s)
public GraphType(java.io.File f)
public GraphType(notio.Relation r)
Method Detail |
public notio.Graph getValue()
public KBase getKBase()
public boolean equals(java.lang.Object other)
public boolean areDesignatorsEquivalent(notio.Graph other)
public Type eqOp(Type other)
public java.lang.String toString()
public boolean containsActorNodes()
public notio.Graph parseGraph(java.lang.Object o)
private boolean areConceptsCompatible(notio.Concept[] c1, notio.Concept[] c2)
private boolean areRelationsCompatible(notio.Relation r1, notio.Relation r2)
public notio.Graph project(notio.Graph filter)
public notio.Graph join(notio.Graph g)
public notio.Graph joinAtHead(notio.Graph g)
public ListType getConcepts()
public ListType getRelations()
public ListType getActors()
public GraphType copy()
public GraphType nocomments()
public Type add(GraphType extraGraph)
This may be too minimal, i.e. may require more checks. Indeed, this function is considered very experimental.
public Type project(GraphType filterGraph)
GraphType.project(Graph)
public Type join(GraphType g)
GraphType.join(Graph)
public Type joinAtHead(GraphType g)
GraphType.joinAtHead(Graph)
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |