@PortedFrom(file="dlCompletionTreeArc.h", name="DlCompletionTreeArc") public class DlCompletionTreeArc extends Object
| Modifier and Type | Field and Description |
|---|---|
protected DepSet |
depSet
dep-set of the arc
|
protected DlCompletionTreeArc |
reverse
pointer to reverse arc
|
protected Role |
role
role, labelling given arc
|
| Constructor and Description |
|---|
DlCompletionTreeArc(Role r,
DepSet dep,
DlCompletionTree n) |
| Modifier and Type | Method and Description |
|---|---|
Restorer |
addDep(DepSet dep)
add dep-set to an edge; return restorer
|
DlCompletionTree |
getArcEnd()
get (RW) access to the end of arc
|
DepSet |
getDep()
get dep-set of the edge
|
DlCompletionTreeArc |
getReverse()
get access to reverse arc
|
Role |
getRole()
get label of the edge
|
boolean |
isIBlocked()
is arc merged to another
|
boolean |
isNeighbour(Role pRole)
check if arc is labelled by a super-role of PROLE
|
boolean |
isNeighbour(Role pRole,
DepSet dep)
same as above; fills DEP with current DEPSET if so
|
boolean |
isPredEdge() |
boolean |
isReflexiveEdge()
check whether the edge is reflexive
|
boolean |
isSuccEdge() |
void |
print(LogAdapter o)
print current arc
|
Restorer |
save()
save and invalidate arc (together with reverse arc)
|
void |
setReverse(DlCompletionTreeArc v)
set given arc as a reverse of current
|
void |
setSuccEdge(boolean val)
set the successor field
|
protected Role role
protected DepSet depSet
protected DlCompletionTreeArc reverse
public DlCompletionTreeArc(Role r, DepSet dep, DlCompletionTree n)
public void setReverse(DlCompletionTreeArc v)
public Role getRole()
public DepSet getDep()
public void setSuccEdge(boolean val)
public boolean isSuccEdge()
public boolean isPredEdge()
public DlCompletionTree getArcEnd()
public DlCompletionTreeArc getReverse()
public boolean isNeighbour(Role pRole)
public boolean isNeighbour(Role pRole, DepSet dep)
public boolean isIBlocked()
public boolean isReflexiveEdge()
public Restorer save()
public void print(LogAdapter o)
Copyright © 2013 The University of Manchester. All Rights Reserved.