uk.ac.manchester.cs.jfact.helpers

Class DLTree

java.lang.Object

uk.ac.manchester.cs.jfact.helpers.DLTree

All Implemented Interfaces:

Serializable

@PortedFrom(file="dltree.h",
            name="TsTTree")
public abstract class DLTree
extends Object
implements Serializable

DLTree class

Author:

ignazio

See Also:

Serialized Form

Method Summary

Methods

Modifier and Type	Method and Description
abstract void	accept(uk.ac.manchester.cs.jfact.helpers.DLTreeVisitor v)
abstract <O> O	accept(uk.ac.manchester.cs.jfact.helpers.DLTreeVisitorEx<O> v)
void	addChild(DLTree d)
void	addFirstChild(DLTree d)
void	addFirstChildren(Collection<DLTree> d)
DLTree	copy()
Lexeme	elem()
boolean	equals(Object obj)
static boolean	equalTrees(DLTree t1, DLTree t2)
DLTree	getAncestor()
abstract DLTree	getChild()
List<DLTree>	getChildren()
abstract DLTree	getLeft()
abstract DLTree	getRight()
int	hashCode()
boolean	isAND()
boolean	isBOTTOM()
boolean	isCN() check if DL tree is a concept-like name
boolean	isCName()
boolean	isConst()
boolean	isName()
boolean	isNOT()
boolean	isTOP()
abstract void	replace(DLTree toReplace, DLTree replacement)
void	setAncestor(DLTree r)
Token	token()
String	toString()

Methods inherited from class java.lang.Object

getClass, notify, notifyAll, wait, wait, wait

Method Detail

token

public Token token()

Returns:

the element token

isTOP

public boolean isTOP()

Returns:

true if the token is top

isNOT

public boolean isNOT()

Returns:

true if the token is not

isBOTTOM

public boolean isBOTTOM()

Returns:

true if the token is bottom

isAND

public boolean isAND()

Returns:

true if the token is and

elem

public Lexeme elem()

Returns:

element

getChild

public abstract DLTree getChild()

Returns:

the chind node for nodes with a single child

getLeft

public abstract DLTree getLeft()

Returns:

the first child for a node with two children

getRight

public abstract DLTree getRight()

Returns:

the second child for a node with two children

getAncestor

public DLTree getAncestor()

Returns:

the ancestor

setAncestor

public void setAncestor(DLTree r)

Parameters:

r - ancestor

addChild

public void addChild(DLTree d)

Parameters:

d - child to add

addFirstChild

public void addFirstChild(DLTree d)

Parameters:

d - child to add in first position

addFirstChildren

public void addFirstChildren(Collection<DLTree> d)

Parameters:

d - children to add in first position

equals

public boolean equals(Object obj)

Overrides:

equals in class Object

toString

public String toString()

Overrides:

toString in class Object

hashCode

public int hashCode()

Overrides:

hashCode in class Object

accept

public abstract void accept(uk.ac.manchester.cs.jfact.helpers.DLTreeVisitor v)

Parameters:

v - v

accept

@Nonnull
public abstract <O> O accept(uk.ac.manchester.cs.jfact.helpers.DLTreeVisitorEx<O> v)

Type Parameters:

O - visitor type

Parameters:

v - v

Returns:

visitor value

replace

public abstract void replace(DLTree toReplace,
           DLTree replacement)

Parameters:

toReplace - toReplace

replacement - replacement

getChildren

public List<DLTree> getChildren()

Returns:

list of children

equalTrees

public static boolean equalTrees(DLTree t1,
                 DLTree t2)

Parameters:

t1 - t1

t2 - t2

Returns:

true if arguments are equal

copy

@Nonnull
public DLTree copy()

Returns:

copy of this tree

isCN

public boolean isCN()

check if DL tree is a concept-like name

Returns:

true if conceptlike name

isConst

public boolean isConst()

Returns:

true if constant

isName

public boolean isName()

Returns:

true if token is a cname or iname

isCName

public boolean isCName()

Returns:

true if token is a cname or iname