Uses of Interface
net.datastructures.PositionList

Uses of PositionList in net.datastructures
 

Subinterfaces of PositionList in net.datastructures
 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
 class NodePositionList<E>
          Realization of a PositionList using a doubly-linked list of nodes.
 

Methods in net.datastructures that return PositionList
 PositionList<Position<E>> TreePosition.getChildren()
          Returns the children of this position
 PositionList<Position<E>> TreeNode.getChildren()
          Returns the children of this position
 

Methods in net.datastructures with parameters of type PositionList
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 TreePosition.setChildren(PositionList<Position<E>> c)
          Sets the right child of this position
 void TreeNode.setChildren(PositionList<Position<E>> c)
          Sets the right child of this position
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
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