at.jku.risc.stout.urauc.data

Class TermNode

java.lang.Object

at.jku.risc.stout.urauc.util.Printable

at.jku.risc.stout.urauc.data.TermNode

All Implemented Interfaces:

Cloneable, Comparable<TermNode>

public class TermNode
extends Printable
implements Cloneable, Comparable<TermNode>

A term node consists of a TermAtom and a Hedge.

Author:

Alexander Baumgartner

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
class	TermNode.TraverseCallBack This class may be used to traverse a term tree and execute an arbitrary operation on every node.

Field Summary

Fields

Modifier and Type	Field and Description
static int[]	POSITION_E

Constructor Summary

Constructors

Constructor and Description
TermNode(TermAtom atom) Instantiates a new term node with an empty hedge.
TermNode(TermAtom atom, Hedge hedge) Instantiates a new term node.

Method Summary

Methods

Modifier and Type	Method and Description
TermNode	apply(Map<Variable,TermNode> sigma) Applies a substitution recursively and returns the new TermNode.
TermNode	clone()
int	compareTo(TermNode other) This compare method treads commutativity by ordered argument sequences.
boolean	equals(Object other)
TermAtom	get(int[] position, int idx)
TermAtom	getAtom()
Hedge	getHedge()
int	hashCode()
void	initPosition(int[] parentIndex, int pos) Initializes all the position indexes recursively starting with the given position parentIndex.childPosition.
boolean	isHole() Tests whether the atom of this term node is the hole.
boolean	isNullAtom() Tests whether the atom of this term node is the null atom.
void	makeAssociative(Set<TermAtom> associativeSymbols)
void	makeCommutative(Set<TermAtom> commutativeSymbols)
boolean	nextCommutativeArrangement()
void	normalizeVarNames(Map<String,String> renaming)
void	print(Writer out)
TermNode	replaceHole(TermNode plugIn) Replaces the hole in this context with the given TermNode (term | hedge | context).
void	setAtom(TermAtom atom) Null values are transformed to unique objects which represent the null value.
void	setHedge(Hedge hedge) Null values are transformed to unique objects which represent the null value.
void	setPositionRecurse(int idx, int value)
void	sortCommutative(boolean sortAll)
TermNode	substitute(Variable from, TermNode to) Substitutes one Variable by a TermNode recursively and returns the new TermNode.
boolean	traverse(TermNode.TraverseCallBack callBack) Traverses the term tree and executes the callback function at every node.
TermAtomList	word()
void	word(TermAtomList atomList)

Methods inherited from class at.jku.risc.stout.urauc.util.Printable

toString

Methods inherited from class java.lang.Object

getClass, notify, notifyAll, wait, wait, wait

Field Detail

POSITION_E

public static final int[] POSITION_E

Constructor Detail

TermNode

public TermNode(TermAtom atom)

Instantiates a new term node with an empty hedge.

See Also:

TermNode(TermAtom, Hedge)

TermNode

public TermNode(TermAtom atom,
        Hedge hedge)

Instantiates a new term node. null values are transformed to unique objects which represent the null value. Such that no NullPointerException can occur.

See Also:

TermAtom.nullAtom, Hedge.nullHedge

Method Detail

apply

public TermNode apply(Map<Variable,TermNode> sigma)

Applies a substitution recursively and returns the new TermNode.

clone

public TermNode clone()

Overrides:

clone in class Object

compareTo

public int compareTo(TermNode other)

This compare method treads commutativity by ordered argument sequences.

Specified by:

compareTo in interface Comparable<TermNode>

equals

public boolean equals(Object other)

Overrides:

equals in class Object

get

public TermAtom get(int[] position,
           int idx)

getAtom

public TermAtom getAtom()

getHedge

public Hedge getHedge()

hashCode

public int hashCode()

Overrides:

hashCode in class Object

initPosition

public void initPosition(int[] parentIndex,
                int pos)

Initializes all the position indexes recursively starting with the given position parentIndex.childPosition.

isHole

public boolean isHole()

Tests whether the atom of this term node is the hole.

isNullAtom

public boolean isNullAtom()

Tests whether the atom of this term node is the null atom.

makeAssociative

public void makeAssociative(Set<TermAtom> associativeSymbols)

makeCommutative

public void makeCommutative(Set<TermAtom> commutativeSymbols)

nextCommutativeArrangement

public boolean nextCommutativeArrangement()

normalizeVarNames

public void normalizeVarNames(Map<String,String> renaming)

print

public void print(Writer out)
           throws IOException

Specified by:

print in class Printable

Throws:

IOException

replaceHole

public TermNode replaceHole(TermNode plugIn)

Replaces the hole in this context with the given TermNode (term | hedge | context). Returns null if no hole has been found, otherwise the new TermNode will be returned.

setAtom

public void setAtom(TermAtom atom)

Null values are transformed to unique objects which represent the null value. So that no NullPointerException can occur.

See Also:

TermAtom.nullAtom

setHedge

public void setHedge(Hedge hedge)

Null values are transformed to unique objects which represent the null value. So that no NullPointerException can occur.

See Also:

Hedge.nullHedge

setPositionRecurse

public void setPositionRecurse(int idx,
                      int value)

sortCommutative

public void sortCommutative(boolean sortAll)

substitute

public TermNode substitute(Variable from,
                  TermNode to)

Substitutes one Variable by a TermNode recursively and returns the new TermNode.

traverse

public boolean traverse(TermNode.TraverseCallBack callBack)

Traverses the term tree and executes the callback function at every node.

See Also:

TermNode.TraverseCallBack

word

public TermAtomList word()

word

public void word(TermAtomList atomList)