edu.ucla.sspace.dependency

Class SimpleDependencyPath

java.lang.Object

edu.ucla.sspace.dependency.SimpleDependencyPath

All Implemented Interfaces:

DependencyPath, Iterable<DependencyRelation>

public class SimpleDependencyPath
extends Object
implements DependencyPath

A DependencyPath that supports constant time access to the nodes and relations that make up its sequence.

Constructor Summary

Constructors

Constructor and Description
SimpleDependencyPath() Creates an empty dependency path
SimpleDependencyPath(DependencyPath path) Creates new SimpleDependencyPath as a copy of the provided path.
SimpleDependencyPath(DependencyRelation relation, boolean startFromHead) Creates a SimpleDependencyPath from a single relation, optionally starting at the head node of the relation.
SimpleDependencyPath(List<DependencyRelation> path) Creates a SimpleDependencyPath starting at the head node of the first relation in the list.
SimpleDependencyPath(List<DependencyRelation> path, boolean isHeadFirst) Creates a SimpleDependencyPath that starts at either the head node or dependent node of the first relation in the list.

Method Summary

Methods

Modifier and Type	Method and Description
SimpleDependencyPath	copy() Returns a copy of this dependency path
boolean	equals(Object o)
SimpleDependencyPath	extend(DependencyRelation relation) Returns a copy of this dependency path that has the provided related appended to the end of its path sequence.
DependencyTreeNode	first() Returns the first node in the path, which is closest to the root.
DependencyRelation	firstRelation() Returns the relation that connects the first and second nodes in the path, which are closest to the root.
DependencyTreeNode	getNode(int position) Returns the node location at the specified position along the path.
String	getRelation(int position) Returns the relation connecting the node at the specified position to the next node.
Iterator<DependencyRelation>	iterator() Returns an iterator over all the relations in the path in order from closest to the root to furthest.
DependencyTreeNode	last() Returns the last node in the path, which is furthest from the root.
DependencyRelation	lastRelation() Returns the relation that connects the last and second to last nodes in the path, which are furthest from the root.
int	length() Returns the number of nodes in the dependency path.
String	toString() Returns the path in order with words and relations space delimited.

Methods inherited from class java.lang.Object

clone, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

SimpleDependencyPath

public SimpleDependencyPath(List<DependencyRelation> path)

Creates a SimpleDependencyPath starting at the head node of the first relation in the list.

SimpleDependencyPath

public SimpleDependencyPath(List<DependencyRelation> path,
                    boolean isHeadFirst)

Creates a SimpleDependencyPath that starts at either the head node or dependent node of the first relation in the list.

SimpleDependencyPath

public SimpleDependencyPath(DependencyPath path)

Creates new SimpleDependencyPath as a copy of the provided path.

SimpleDependencyPath

public SimpleDependencyPath(DependencyRelation relation,
                    boolean startFromHead)

Creates a SimpleDependencyPath from a single relation, optionally starting at the head node of the relation.

SimpleDependencyPath

public SimpleDependencyPath()

Creates an empty dependency path

Method Detail

copy

public SimpleDependencyPath copy()

Returns a copy of this dependency path

extend

public SimpleDependencyPath extend(DependencyRelation relation)

Returns a copy of this dependency path that has the provided related appended to the end of its path sequence.

equals

public boolean equals(Object o)

Overrides:

equals in class Object

first

public DependencyTreeNode first()

Returns the first node in the path, which is closest to the root.

Specified by:

first in interface DependencyPath

firstRelation

public DependencyRelation firstRelation()

Returns the relation that connects the first and second nodes in the path, which are closest to the root.

Specified by:

firstRelation in interface DependencyPath

getNode

public DependencyTreeNode getNode(int position)

Returns the node location at the specified position along the path.

Specified by:

getNode in interface DependencyPath

getRelation

public String getRelation(int position)

Returns the relation connecting the node at the specified position to the next node. Note that for the last node in the path, no relation exists, so there are at most length() - 1 relations in the path.

Specified by:

getRelation in interface DependencyPath

iterator

public Iterator<DependencyRelation> iterator()

Returns an iterator over all the relations in the path in order from closest to the root to furthest.

Specified by:

iterator in interface DependencyPath

Specified by:

iterator in interface Iterable<DependencyRelation>

last

public DependencyTreeNode last()

Returns the last node in the path, which is furthest from the root.

Specified by:

last in interface DependencyPath

lastRelation

public DependencyRelation lastRelation()

Returns the relation that connects the last and second to last nodes in the path, which are furthest from the root.

Specified by:

lastRelation in interface DependencyPath

length

public int length()

Returns the number of nodes in the dependency path. The number of relations in the path will be length() - 1.

Specified by:

length in interface DependencyPath

toString

public String toString()

Returns the path in order with words and relations space delimited.

Overrides:

toString in class Object