@PortedFrom(file="dlCompletionTreeArc.h", name="DlCompletionTreeArc") public class DlCompletionTreeArc extends Object implements Serializable
| 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() |
DepSet |
getDep() |
DlCompletionTreeArc |
getReverse() |
Role |
getRole() |
boolean |
isIBlocked() |
boolean |
isNeighbour(Role pRole) |
boolean |
isPredEdge() |
boolean |
isReflexiveEdge() |
boolean |
isSuccEdge() |
DepSet |
neighbourDepSet(Role pRole) |
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
|
boolean |
unblockable() |
public DlCompletionTreeArc(Role r, DepSet dep, DlCompletionTree n)
r - rdep - depn - npublic void setReverse(DlCompletionTreeArc v)
v - vpublic DepSet getDep()
public void setSuccEdge(boolean val)
val - valpublic boolean isSuccEdge()
public boolean unblockable()
public boolean isPredEdge()
public DlCompletionTree getArcEnd()
public DlCompletionTreeArc getReverse()
public boolean isNeighbour(Role pRole)
pRole - pRole@Nullable public DepSet neighbourDepSet(Role pRole)
pRole - pRolepublic boolean isIBlocked()
public boolean isReflexiveEdge()
@Nullable public Restorer save()
@Nullable public Restorer addDep(DepSet dep)
dep - deppublic void print(LogAdapter o)
o - oCopyright © 2018 The University of Manchester. All rights reserved.