Uses of Interface
net.datastructures.PositionList

Packages that use PositionList

Package	Description
net.datastructures
support.graph

Uses of PositionList in net.datastructures

Subinterfaces of PositionList in net.datastructures

Modifier and Type	Interface and Description
interface	Sequence<E> An interface for a sequence, a data structure supporting all operations of a deque, indexed list and position list.

Classes in net.datastructures that implement PositionList

Modifier and Type	Class and Description
class	NodePositionList<E> Realization of a PositionList using a doubly-linked list of nodes.

Methods in net.datastructures that return PositionList

Modifier and Type	Method and Description
PositionList<Position<E>>	TreeNode.getChildren() Returns the children of this position
PositionList<Position<E>>	TreePosition.getChildren()

Methods in net.datastructures with parameters of type PositionList

Modifier and Type	Method and Description
static <E> java.lang.String	NodePositionList.forEachToString(PositionList<E> L) Returns a textual representation of a given node list using for-each
static <E> void	Sort.merge(PositionList<E> in1, PositionList<E> in2, java.util.Comparator<E> c, PositionList<E> in) Merges two sorted lists, in1 and in2, into a sorted list in.
static <E> void	Sort.merge(PositionList<E> in1, PositionList<E> in2, java.util.Comparator<E> c, PositionList<E> in) Merges two sorted lists, in1 and in2, into a sorted list in.
static <E> void	Sort.merge(PositionList<E> in1, PositionList<E> in2, java.util.Comparator<E> c, PositionList<E> in) Merges two sorted lists, in1 and in2, into a sorted list in.
static <E> void	Sort.mergeSort(PositionList<E> in, java.util.Comparator<E> c) Sorts the elements of list in in nondecreasing order according to comparator c, using the merge-sort algorithm.
static <E> void	Sort.quickSort(PositionList<E> in, java.util.Comparator<E> c) Sorts the elements of list in in nondecreasing order according to comparator c, using a list-based implementation of the deterministic quicksort algorithm.
void	TreeNode.setChildren(PositionList<Position<E>> c) Sets the right child of this position
void	TreePosition.setChildren(PositionList<Position<E>> c)
static <E> java.lang.String	NodePositionList.toString(PositionList<E> l) Returns a textual representation of a given node list

Constructors in net.datastructures with parameters of type PositionList

Constructor and Description
ElementIterator(PositionList<E> L) Creates an element iterator over the given list.
SortedListAdaptablePriorityQueue(PositionList<Entry<K,V>> list, java.util.Comparator<K> comp) Creates the priority queue with the given comparator and list.
SortedListPriorityQueue(PositionList<Entry<K,V>> list, java.util.Comparator<K> comp) Creates the priority queue with the given comparator and list.
TreeNode(E element, TreePosition<E> parent, PositionList<Position<E>> children) Main constructor

Uses of PositionList in support.graph

Classes in support.graph that implement PositionList

Modifier and Type	Class and Description
class	NodeSequence<E> An implementation of the Sequence ADT