@PortedFrom(file="taxVertex.h", name="TaxonomyVertex") public class TaxonomyVertex extends Object
| Constructor and Description |
|---|
TaxonomyVertex() |
TaxonomyVertex(ClassifiableEntry p)
init c'tor; use it only for Top/Bot initialisations
|
| Modifier and Type | Method and Description |
|---|---|
void |
addNeighbour(boolean upDirection,
TaxonomyVertex p)
add link in given direction to vertex
|
void |
addSynonym(ClassifiableEntry p)
add P as a synonym to curent vertex
|
Set<ClassifiableEntry> |
begin_syn() |
void |
clear()
clears the vertex
|
void |
clearCommon() |
void |
clearLinks(boolean upDirection)
clear all links in a given direction
|
boolean |
correctCommon(int n)
keep COMMON flag iff both flags are set; @return true if it is the case
|
ClassifiableEntry |
getPrimer() |
TaxonomyVertex |
getSynonymNode() |
boolean |
getValue() |
void |
incorporate(JFactReasonerConfiguration c) |
boolean |
isChecked(long checkLab) |
boolean |
isCommon() |
boolean |
isValued(long valueLab) |
List<TaxonomyVertex> |
neigh(boolean upDirection)
indirect RW access to Links
|
boolean |
noNeighbours(boolean upDirection)
check if vertex has no neighbours in given direction
|
String |
printNeighbours(boolean upDirection) |
String |
printSynonyms() |
void |
removeLastLink(boolean upDirection)
remove latest link (usually to the BOTTOM node)
|
boolean |
removeLink(boolean upDirection,
TaxonomyVertex p) |
void |
setChecked(long checkLab) |
void |
setCommon() |
void |
setHostVertex(ClassifiableEntry entry)
mark vertex as the one corresponding to a given ENTRY
|
void |
setSample(ClassifiableEntry entry,
boolean linkBack)
set sample to ENTRY
|
boolean |
setValued(boolean val,
long valueLab) |
String |
toString() |
public TaxonomyVertex()
public TaxonomyVertex(ClassifiableEntry p)
@PortedFrom(file="taxVertex.h", name="setHostVertex") public void setHostVertex(ClassifiableEntry entry)
@PortedFrom(file="taxVertex.h", name="setSample") public void setSample(ClassifiableEntry entry, boolean linkBack)
@PortedFrom(file="taxVertex.h", name="neigh") public List<TaxonomyVertex> neigh(boolean upDirection)
@PortedFrom(file="taxVertex.h", name="isChecked") public boolean isChecked(long checkLab)
@PortedFrom(file="taxVertex.h", name="setChecked") public void setChecked(long checkLab)
@PortedFrom(file="taxVertex.h", name="isValued") public boolean isValued(long valueLab)
@PortedFrom(file="taxVertex.h", name="getValue") public boolean getValue()
@PortedFrom(file="taxVertex.h", name="setValued") public boolean setValued(boolean val, long valueLab)
@PortedFrom(file="taxVertex.h", name="isCommon") public boolean isCommon()
@PortedFrom(file="taxVertex.h", name="setCommon") public void setCommon()
@PortedFrom(file="taxVertex.h", name="clearCommon") public void clearCommon()
@PortedFrom(file="taxVertex.h", name="correctCommon") public boolean correctCommon(int n)
@PortedFrom(file="taxVertex.h", name="begin_syn") public Set<ClassifiableEntry> begin_syn()
@PortedFrom(file="taxVertex.h", name="addSynonym") public void addSynonym(ClassifiableEntry p)
@PortedFrom(file="taxVertex.h", name="clear") public void clear()
@PortedFrom(file="taxVertex.h", name="getPrimer") public ClassifiableEntry getPrimer()
@PortedFrom(file="taxVertex.h", name="addNeighbour") public void addNeighbour(boolean upDirection, TaxonomyVertex p)
@PortedFrom(file="taxVertex.h", name="noNeighbours") public boolean noNeighbours(boolean upDirection)
@PortedFrom(file="taxVertex.h", name="getSynonymNode") public TaxonomyVertex getSynonymNode()
@PortedFrom(file="taxVertex.h", name="removeLastLink") public void removeLastLink(boolean upDirection)
@PortedFrom(file="taxVertex.h", name="clearLinks") public void clearLinks(boolean upDirection)
@PortedFrom(file="taxVertex.h", name="removeLink") public boolean removeLink(boolean upDirection, TaxonomyVertex p)
@PortedFrom(file="taxVertex.h", name="incorporate") public void incorporate(JFactReasonerConfiguration c)
@PortedFrom(file="taxVertex.h", name="printSynonyms") public String printSynonyms()
@PortedFrom(file="taxVertex.h", name="printNeighbours") public String printNeighbours(boolean upDirection)
Copyright © 2013 The University of Manchester. All Rights Reserved.