A B C D E F G H I J K L M N O P Q R S T U V W X Y Z _

A

ABOVE - Static variable in interface jdsl.geomobj.api.GeomTester2D
 
aboveBelow(Point2D, LinearCurve2D) - Method in interface jdsl.geomobj.api.GeomTester2D
 
aboveBelow(Point2D, LinearCurve2D) - Method in class jdsl.geomobj.ref.GeomTester2DImpl
 
aboveBelow(Point2D, Point2D) - Method in interface jdsl.geomobj.api.TwoArgsGeomTests2D
 
aboveBelow(Point2D, Point2D) - Method in class jdsl.geomobj.ref.GeomTester2DImpl
 
aboveBelow(Point2D, Point2D) - Method in class jdsl.geomobj.ref.RatIntGeomTests2D
 
aboveBelow(Point2D, Point2D) - Method in class jdsl.geomobj.ref.IntRatGeomTests2D
 
aboveBelow(Point2D, Point2D) - Method in class jdsl.geomobj.ref.RatRatGeomTests2D
 
aboveBelow(Point2D, Point2D) - Method in class jdsl.geomobj.ref.IntIntGeomTests2D
 
AbstractArrayIterator - class jdsl.core.ref.AbstractArrayIterator.
A class abstracting the common parts of ArrayPositionIterator and ArrayLocatorIterator.
AbstractArrayIterator(Accessor[]) - Constructor for class jdsl.core.ref.AbstractArrayIterator
Uses the array to store the elements that this iterator traverses.
AbstractArrayIterator(Accessor[], int) - Constructor for class jdsl.core.ref.AbstractArrayIterator
Traverses through the array until the first num elements have been returned.
AbstractCircle2D - class jdsl.geomobj.ref.AbstractCircle2D.
An abstract class extended by IntCircle2D and RatCircle2D.
AbstractCircle2D() - Constructor for class jdsl.geomobj.ref.AbstractCircle2D
 
AbstractCircularSequence - class jdsl.core.ref.AbstractCircularSequence.
An abstract class implementing some methods of the CircularSequence interface.
AbstractCircularSequence() - Constructor for class jdsl.core.ref.AbstractCircularSequence
 
AbstractComparator - class jdsl.core.ref.AbstractComparator.
An abstract class implementing some methods of the Comparator interface.
AbstractComparator() - Constructor for class jdsl.core.ref.AbstractComparator
 
AbstractDictionary - class jdsl.core.ref.AbstractDictionary.
An abstraction of the Dictionary implementations that ensures the existence of a method to insert Locators back into the data structure.
AbstractDictionary() - Constructor for class jdsl.core.ref.AbstractDictionary
 
AbstractGeomObject2D - class jdsl.geomobj.ref.AbstractGeomObject2D.
This abstract class is the superclass for all two-dimensional objects.
AbstractGeomObject2D() - Constructor for class jdsl.geomobj.ref.AbstractGeomObject2D
 
AbstractGraph - class jdsl.graph.ref.AbstractGraph.
An implementation of many of the methods of InspectableGraph in terms of a few primitives.
AbstractGraph.OO_to_O_MergerIterator - class jdsl.graph.ref.AbstractGraph.OO_to_O_MergerIterator.
 
AbstractGraph.OO_to_O_MergerIterator(ObjectIterator, ObjectIterator) - Constructor for class jdsl.graph.ref.AbstractGraph.OO_to_O_MergerIterator
Assumes neither iterator is null
AbstractGraph() - Constructor for class jdsl.graph.ref.AbstractGraph
 
AbstractIntLinearCurve2D - class jdsl.geomobj.ref.AbstractIntLinearCurve2D.
An abstract class extended by IntLine2D, IntRay2D, and IntSegment2D.
AbstractLinearCurve2D - class jdsl.geomobj.ref.AbstractLinearCurve2D.
An abstract class extended by AbstractIntLinearCurve2D and AbstractRatLinearCurve2D.
AbstractLinearCurve2D() - Constructor for class jdsl.geomobj.ref.AbstractLinearCurve2D
 
AbstractPositionalContainer - class jdsl.core.ref.AbstractPositionalContainer.
An abstract positional container that others may extend if they do not wish to deal with some of the more mundane aspects of positional containers and/or if they wish to avoid implementing themselves some of the methods of container that aren't terribly pertinent to a PositionalContainer.
AbstractPositionalContainer() - Constructor for class jdsl.core.ref.AbstractPositionalContainer
 
AbstractRatLinearCurve2D - class jdsl.geomobj.ref.AbstractRatLinearCurve2D.
An abstract class extended by RatLine2D, RatRay2D, and RatSegment2D.
AbstractRealLinearCurve2D - class jdsl.geomobj.ref.AbstractRealLinearCurve2D.
An abstract class extended by RealLine2D, RealRay2D, and RealSegment2D.
AbstractTopologicalSort - class jdsl.graph.algo.AbstractTopologicalSort.
This abstract class is the foundation for both types of topological sorts, that is, the standard variety where each vertex is given a unique number, and the level-numbering variety in which numbers attached to vertices are not unique.
AbstractTopologicalSort() - Constructor for class jdsl.graph.algo.AbstractTopologicalSort
Constructor.
Accessor - interface jdsl.core.api.Accessor.
All JDSL core containers provide a way to access their internal structure; Accessor is the interface that embodies this concept.
aCommonFace(Edge, Edge) - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
aCommonFace(Edge, Edge) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
aCommonFace(Vertex, Vertex) - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
aCommonFace(Vertex, Vertex) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(degree(v1)+degree(v2))
aCommonVertex(Edge, Edge) - Method in interface jdsl.graph.api.InspectableGraph
 
aCommonVertex(Edge, Edge) - Method in class jdsl.graph.ref.AbstractGraph
Built on endVertices(.)
aConnectingEdge(Vertex, Vertex) - Method in interface jdsl.graph.api.InspectableGraph
Gives an arbitrary edge from among those connecting the two specified vertices.
aConnectingEdge(Vertex, Vertex) - Method in class jdsl.graph.ref.AbstractGraph
Built on incidentEdges(.)
adjacentFaces(Face) - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
adjacentFaces(Face) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(degree(f))
adjacentVertices(Vertex) - Method in interface jdsl.graph.api.InspectableGraph
Lists all vertices adjacent to a particular vertex by any kind of edge, with repeats corresponding to parallel edges.
adjacentVertices(Vertex) - Method in class jdsl.graph.ref.AbstractGraph
Built on incidentEdges(.)
adjacentVertices(Vertex, int) - Method in interface jdsl.graph.api.InspectableGraph
Lists all vertices adjacent to a particular vertex by all edges of the types specified.
adjacentVertices(Vertex, int) - Method in class jdsl.graph.ref.AbstractGraph
Built on incidentEdges(.)
aFace() - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
aFace() - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
in the current implementation there is always at least one face O(1)
AFTER - Static variable in class jdsl.map.api.Order
 
AFTER_CCW - Static variable in class jdsl.map.api.Order
 
AFTER_CW - Static variable in class jdsl.map.api.Order
 
AFTER_LHS - Static variable in class jdsl.map.api.Order
 
AFTER_RHS - Static variable in class jdsl.map.api.Order
 
after(Locator) - Method in interface jdsl.core.api.InspectableOrderedDictionary
Returns the Locator that is sequentially after another Locator in this Container.
after(Locator) - Method in class jdsl.core.ref.ArraySkipList
Runs in O(1) time.
after(Locator) - Method in class jdsl.core.ref.RedBlackTree
Takes O(logN) time -- may need to traverse the height of the tree to find the next note that we do not return color-locators in the leaves -- we only return key locators.
after(Position) - Method in interface jdsl.core.api.InspectableSequence
The next position in the sequence.
after(Position) - Method in interface jdsl.core.api.InspectableCircularSequence
Find the position after the given one
after(Position) - Method in class jdsl.core.ref.NodeCircularSequence
O(1)
after(Position) - Method in class jdsl.core.ref.ArraySequence
O(1) time.
after(Position) - Method in class jdsl.core.ref.NodeSequence
O(1) time
allVertices() - Method in class jdsl.graph.algo.IntegerPrimTemplate
Can be overridden to consider a subset of the vertices in the graph, although I can't think of any reason to do so.
AnachronismException - exception jdsl.graph.algo.AnachronismException.
This is an exception thrown specifically by the DFS to signify that an internal error has arisen in the computation of start/finish times.
AnachronismException() - Constructor for class jdsl.graph.algo.AnachronismException
A default constructor.
AnachronismException(String) - Constructor for class jdsl.graph.algo.AnachronismException
A constructor that takes a String that (hopefully) contains a relevant message about the circumstances under which this exception was thrown.
anEdge() - Method in interface jdsl.graph.api.InspectableGraph
 
anEdge() - Method in class jdsl.graph.ref.InspectableSubgraph
This runs in time proportional to the running time of the corresponding method in the graph around which this subgraph wraps.
anEdge() - Method in class jdsl.graph.ref.IncidenceListGraph
O(1)
anEdge() - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
anEdge() - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
anIncidentEdge(Face) - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
anIncidentEdge(Face) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
anIncidentEdge(Vertex) - Method in interface jdsl.graph.api.InspectableGraph
 
anIncidentEdge(Vertex) - Method in class jdsl.graph.ref.InspectableSubgraph
This runs in time proportional to the running time of the corresponding method in the graph around which this subgraph wraps.
anIncidentEdge(Vertex) - Method in class jdsl.graph.ref.IncidenceListGraph
O(1)
anIncidentEdge(Vertex) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
anIncidentEdge(Vertex) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
anIncidentEdge(Vertex, int) - Method in interface jdsl.graph.api.InspectableGraph
 
anIncidentEdge(Vertex, int) - Method in class jdsl.graph.ref.InspectableSubgraph
This runs in time proportional to the running time of the corresponding method in the graph around which this subgraph wraps.
anIncidentEdge(Vertex, int) - Method in class jdsl.graph.ref.IncidenceListGraph
O(degree)
anIncidentEdge(Vertex, int) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(degree(v))
anIncidentEdge(Vertex, int) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(degree)
anIncidentFace(Vertex) - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
anIncidentFace(Vertex) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
anIncidentVertex(Face) - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
anIncidentVertex(Face) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
approxSqRadius_ - Variable in class jdsl.geomobj.ref.AbstractCircle2D
 
approxSqRadius_computed_ - Variable in class jdsl.geomobj.ref.AbstractCircle2D
 
areAdjacent(Edge, Edge) - Method in interface jdsl.graph.api.InspectableGraph
Checks whether two edges have at least one common endpoint.
areAdjacent(Edge, Edge) - Method in class jdsl.graph.ref.AbstractGraph
Built on endVertices(.)
areAdjacent(Edge, Edge) - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
areAdjacent(Edge, Edge) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
areAdjacent(Face, Face) - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
areAdjacent(Face, Face) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(min(degree(f1),degree(f2)))
areAdjacent(Vertex, Vertex) - Method in interface jdsl.graph.api.InspectableGraph
 
areAdjacent(Vertex, Vertex) - Method in class jdsl.graph.ref.AbstractGraph
Built on incidentEdges(.)
areEqual(Point2D, Point2D) - Method in interface jdsl.geomobj.api.GeomTester2D
 
areEqual(Point2D, Point2D) - Method in class jdsl.geomobj.ref.GeomTester2DImpl
 
areIncident(Edge, Face) - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
areIncident(Edge, Face) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
areIncident(Vertex, Edge) - Method in interface jdsl.graph.api.InspectableGraph
 
areIncident(Vertex, Edge) - Method in class jdsl.graph.ref.InspectableSubgraph
O(1)
areIncident(Vertex, Edge) - Method in class jdsl.graph.ref.IncidenceListGraph
O(1)
areIncident(Vertex, Edge) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
areIncident(Vertex, Edge) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
areIncident(Vertex, Face) - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
areIncident(Vertex, Face) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(degree(v))
arithmeticType() - Method in interface jdsl.geomobj.api.GeomObject
The arithmetic type of a geometric object is encoded as an integer number.
arithmeticType() - Method in class jdsl.geomobj.api.Point2D.InfinitePoint2D
 
arithmeticType() - Method in class jdsl.geomobj.api.GeomObject2D.NoneGeomObject2D
 
arithmeticType() - Method in class jdsl.geomobj.ref.AbstractRealLinearCurve2D
 
arithmeticType() - Method in class jdsl.geomobj.ref.AbstractIntLinearCurve2D
 
arithmeticType() - Method in class jdsl.geomobj.ref.AbstractRatLinearCurve2D
 
arithmeticType() - Method in class jdsl.geomobj.ref.RealDirection2D
 
arithmeticType() - Method in class jdsl.geomobj.ref.RatDirection2D
 
arithmeticType() - Method in class jdsl.geomobj.ref.RealPoint2D
 
arithmeticType() - Method in class jdsl.geomobj.ref.IntRectangle2D
 
arithmeticType() - Method in class jdsl.geomobj.ref.RatCircle2D
 
arithmeticType() - Method in class jdsl.geomobj.ref.IntPoint2D
 
arithmeticType() - Method in class jdsl.geomobj.ref.RatPoint2D
 
arithmeticType() - Method in class jdsl.geomobj.ref.RatRectangle2D
 
arithmeticType() - Method in class jdsl.geomobj.ref.IntCircle2D
 
arithmeticType() - Method in class jdsl.geomobj.ref.IntDirection2D
 
ArrayHeap - class jdsl.core.ref.ArrayHeap.
An array implementation of a heap.
ArrayHeap(Comparator) - Constructor for class jdsl.core.ref.ArrayHeap
Creates a new heap.
ArrayHeap(Comparator, boolean) - Constructor for class jdsl.core.ref.ArrayHeap
Creates a new heap.
ArrayHeap(Comparator, int, boolean) - Constructor for class jdsl.core.ref.ArrayHeap
Creates a new heap.
ArrayLocatorIterator - class jdsl.core.ref.ArrayLocatorIterator.
An array-based locator iterator.
ArrayLocatorIterator(Locator[]) - Constructor for class jdsl.core.ref.ArrayLocatorIterator
Uses the array to store the elements that this iterator traverses.
ArrayLocatorIterator(Locator[], int) - Constructor for class jdsl.core.ref.ArrayLocatorIterator
Traverses through the array, which is not copied, until num elements have been returned.
ArrayMergeSort - class jdsl.core.algo.sorts.ArrayMergeSort.
Performs a merge-sort in O(n log n) time, provided that the atRank(int) method of the Sequence works in O(1) time.
ArrayMergeSort() - Constructor for class jdsl.core.algo.sorts.ArrayMergeSort
 
ArrayObjectIterator - class jdsl.core.ref.ArrayObjectIterator.
An array-based object iterator.
ArrayObjectIterator(Object[]) - Constructor for class jdsl.core.ref.ArrayObjectIterator
Uses the array to store the elements that this iterator traverses.
ArrayObjectIterator(Object[], int) - Constructor for class jdsl.core.ref.ArrayObjectIterator
Traverses through the array, which is not copied, until num elements have been returned.
ArrayPositionIterator - class jdsl.core.ref.ArrayPositionIterator.
An array-based positional iterator.
ArrayPositionIterator(Position[]) - Constructor for class jdsl.core.ref.ArrayPositionIterator
Uses the array to store the elements that this iterator traverses.
ArrayPositionIterator(Position[], int) - Constructor for class jdsl.core.ref.ArrayPositionIterator
Traverses through the array, which is not copied, until num elements have been returned.
ArrayQuickSort - class jdsl.core.algo.sorts.ArrayQuickSort.
Performs an in-place quicksort in expected O(n log n) time, provided that the atRank(int) method of the Sequence operates in O(1) time.
ArrayQuickSort() - Constructor for class jdsl.core.algo.sorts.ArrayQuickSort
 
ArraySequence - class jdsl.core.ref.ArraySequence.
A Sequence implemented on top of an array.
ArraySequence() - Constructor for class jdsl.core.ref.ArraySequence
The default constructor for ArraySequence Initial array capacity defaults to 16.
ArraySequence(boolean) - Constructor for class jdsl.core.ref.ArraySequence
Creates an empty Sequence.
ArraySequence(int) - Constructor for class jdsl.core.ref.ArraySequence
Creates an empty Sequence.
ArraySequence(int, boolean) - Constructor for class jdsl.core.ref.ArraySequence
Creates an empty Sequence.
ArraySkipList - class jdsl.core.ref.ArraySkipList.
Implementation of a skip list The ordered dictionary is a multi-map which means that it is possible for two elements to have the same key.
ArraySkipList(Comparator) - Constructor for class jdsl.core.ref.ArraySkipList
Runs in O(1 + t) time where t is the time it takes to create the head node with (DEFAULT_MAX_LEVEL+1) forward links.
ArraySkipList(Comparator, int) - Constructor for class jdsl.core.ref.ArraySkipList
Runs in O(1 + t) time where t is the time it takes to create the head node with (DEFAULT_MAX_LEVEL+1) forward links.
ArraySkipList(Comparator, int, long) - Constructor for class jdsl.core.ref.ArraySkipList
Runs in O(1 + t) time where t is the time it takes to create the head node with (maxLevel+1) forward links.
arrayToSequence(Object[], Sequence) - Static method in class jdsl.core.util.Converter
Places the contents of an array into a sequence, preserving order
Assertion - class jdsl.core.ref.Assertion.
Helps to check invariant conditions in program and check correctness of implementation.
AssertionException - exception jdsl.core.ref.AssertionException.
This exception indicates that an internal check has failed.
AssertionException() - Constructor for class jdsl.core.ref.AssertionException
 
AssertionException(String) - Constructor for class jdsl.core.ref.AssertionException
 
atRank(int) - Method in interface jdsl.core.api.InspectableSequence
Get the position in the sequence with the specified rank
atRank(int) - Method in class jdsl.core.ref.ArraySequence
O(1) time.
atRank(int) - Method in class jdsl.core.ref.NodeSequence
O(1) time if the positions_ cache is valid (no modifications since cache was generated) O(N) if cache is invalid (must traverse up to half of Sequence)
attachVertex(Vertex, Object, Object) - Method in interface jdsl.graph.api.Graph
Attaches a new vertex, containing an object, to an existing vertex by inserting a new undirected edge.
attachVertex(Vertex, Object, Object) - Method in class jdsl.graph.ref.IncidenceListGraph
O(1)
attachVertex(Vertex, Object, Object) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
 
attachVertex(Vertex, Order, Edge, Face, Object, Object) - Method in interface jdsl.map.api.EmbeddedPlanarGraph
Attaches a new vertex to an existing vertex by inserting a new edge in a specified order.
attachVertex(Vertex, Order, Edge, Face, Object, Object) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
attachVertex(Vertex, Order, Edge, Object, Object) - Method in interface jdsl.map.api.OrderedGraph
Attaches a new vertex to an existing vertex by inserting a new edge in a specified order.
attachVertex(Vertex, Order, Edge, Object, Object) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
attachVertexFrom(Vertex, Object, Object) - Method in interface jdsl.graph.api.Graph
Attaches a new vertex, containing an object, by inserting a new directed edge from an existing vertex.
attachVertexFrom(Vertex, Object, Object) - Method in class jdsl.graph.ref.IncidenceListGraph
O(1)
attachVertexFrom(Vertex, Object, Object) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
 
attachVertexFrom(Vertex, Order, Edge, Face, Object, Object) - Method in interface jdsl.map.api.EmbeddedPlanarGraph
Attaches a new vertex by inserting a new directed edge in a specified order from an existing vertex.
attachVertexFrom(Vertex, Order, Edge, Face, Object, Object) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
attachVertexFrom(Vertex, Order, Edge, Object, Object) - Method in interface jdsl.map.api.OrderedGraph
Attaches a new vertex by inserting a new directed edge from an existing vertex in a specified order.
attachVertexFrom(Vertex, Order, Edge, Object, Object) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
attachVertexTo(Vertex, Object, Object) - Method in interface jdsl.graph.api.Graph
Attaches a new vertex, containing an object, by inserting a new directed edge to an existing vertex.
attachVertexTo(Vertex, Object, Object) - Method in class jdsl.graph.ref.IncidenceListGraph
O(1)
attachVertexTo(Vertex, Object, Object) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
 
attachVertexTo(Vertex, Order, Edge, Face, Object, Object) - Method in interface jdsl.map.api.EmbeddedPlanarGraph
Attaches a new vertex by inserting a new directed edge in a specified order to an existing vertex.
attachVertexTo(Vertex, Order, Edge, Face, Object, Object) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
attachVertexTo(Vertex, Order, Edge, Object, Object) - Method in interface jdsl.map.api.OrderedGraph
Attaches a new vertex by inserting a new directed edge to an existing vertex in a specified position.
attachVertexTo(Vertex, Order, Edge, Object, Object) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
aVertex() - Method in interface jdsl.graph.api.InspectableGraph
 
aVertex() - Method in class jdsl.graph.ref.InspectableSubgraph
This runs in time proportional to the running time of the corresponding method in the graph around which this subgraph wraps.
aVertex() - Method in class jdsl.graph.ref.IncidenceListGraph
O(1)
aVertex() - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
aVertex() - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)

B

BACK_EDGE - Static variable in class jdsl.graph.algo.DFS
Constant signifying that a marked edge is a back edge.
badWeight(Vertex, Edge, int) - Method in class jdsl.graph.algo.IntegerPrimTemplate
Can be overridden to handle edges that have zero or negative weights.
BEFORE - Static variable in class jdsl.map.api.Order
 
before(Locator) - Method in interface jdsl.core.api.InspectableOrderedDictionary
Returns the Locator that is sequentially before another Locator in this Container.
before(Locator) - Method in class jdsl.core.ref.ArraySkipList
Runs in O(1) time.
before(Locator) - Method in class jdsl.core.ref.RedBlackTree
Takes O(logN) time -- may need to traverse the height of the tree to find the next note that we do not return color-locators in the leaves -- we only return key locators.
before(Position) - Method in interface jdsl.core.api.InspectableSequence
The previous position in the sequence.
before(Position) - Method in interface jdsl.core.api.InspectableCircularSequence
Find the position before the given one
before(Position) - Method in class jdsl.core.ref.NodeCircularSequence
O(1)
before(Position) - Method in class jdsl.core.ref.ArraySequence
O(1) time.
before(Position) - Method in class jdsl.core.ref.NodeSequence
O(1) time
BELOW - Static variable in interface jdsl.geomobj.api.GeomTester2D
 
BFS - class jdsl.graph.algo.BFS.
Class implementing an abstract Breadth First Search.
BFS() - Constructor for class jdsl.graph.algo.BFS
 
BigIntegerComparator - class jdsl.core.ref.BigIntegerComparator.
Compares java.math.BigInteger objects.
BigIntegerComparator() - Constructor for class jdsl.core.ref.BigIntegerComparator
 
BigIntegerToByteArray - class jdsl.core.ref.BigIntegerToByteArray.
Converts a big integer to a byte array.
BigIntegerToByteArray() - Constructor for class jdsl.core.ref.BigIntegerToByteArray
 
BinaryTree - interface jdsl.core.api.BinaryTree.
A modifiable tree in which each node has either zero or two children.
BLACK - Static variable in class jdsl.core.ref.RedBlackTree
 
bottom_ - Variable in class jdsl.geomobj.ref.AbstractLinearCurve2D
 
bottomLeft_ - Variable in class jdsl.geomobj.ref.IntRectangle2D
 
bottomLeft_ - Variable in class jdsl.geomobj.ref.RatRectangle2D
 
bottomLeftPoint() - Method in interface jdsl.geomobj.api.Rectangle2D
 
bottomLeftPoint() - Method in class jdsl.geomobj.ref.IntRectangle2D
 
bottomLeftPoint() - Method in class jdsl.geomobj.ref.RatRectangle2D
 
bottomPoint() - Method in interface jdsl.geomobj.api.Segment2D
 
bottomPoint() - Method in class jdsl.geomobj.ref.IntSegment2D
 
bottomPoint() - Method in class jdsl.geomobj.ref.RealSegment2D
 
bottomPoint() - Method in class jdsl.geomobj.ref.RatSegment2D
 
bottomRight_ - Variable in class jdsl.geomobj.ref.IntRectangle2D
 
bottomRight_ - Variable in class jdsl.geomobj.ref.RatRectangle2D
 
bottomRightPoint() - Method in interface jdsl.geomobj.api.Rectangle2D
 
bottomRightPoint() - Method in class jdsl.geomobj.ref.IntRectangle2D
 
bottomRightPoint() - Method in class jdsl.geomobj.ref.RatRectangle2D
 
BOUNDARY_VIOLATION - Static variable in interface jdsl.core.api.InspectableOrderedDictionary
Object returned from all four methodsof InspectableOrderedDictionary to indicate that the user tried to access before the first element of the dictionary or after the last.
BoundaryViolationException - exception jdsl.core.api.BoundaryViolationException.
Package jdsl.core.api
class BoundaryViolationException
BoundaryViolationException(String) - Constructor for class jdsl.core.api.BoundaryViolationException
 
ByteArrayComparator - class jdsl.core.ref.ByteArrayComparator.
Superclass for all byte array comparator implementations.
ByteArrayComparator() - Constructor for class jdsl.core.ref.ByteArrayComparator
 

C

capacity() - Method in class jdsl.core.ref.HashtableDecorable
Gets the capacity of this hashtable.
case1(Position, Position) - Method in class jdsl.core.ref.RedBlackTree
Takes O(1) time Implements case 1, the Restructuring case Protected for purposes of allowing snapshots during visualization
case2(Position) - Method in class jdsl.core.ref.RedBlackTree
Takes O(1) time Implements case 2, the Recoloring case Protected for purposes of allowing snapshots during visualization
case3(Position) - Method in class jdsl.core.ref.RedBlackTree
Takes O(1) time Implements case 3, the Adjustment case Protected for purposes of allowing snapshots during visualization
castPosition(Accessor) - Method in class jdsl.core.ref.NodeCircularSequence
Convenience method to check if an Accessor can be used in this * Sequence.
center_ - Variable in class jdsl.geomobj.ref.AbstractCircle2D
 
center() - Method in interface jdsl.geomobj.api.Circle2D
 
center() - Method in class jdsl.geomobj.ref.AbstractCircle2D
 
check(boolean) - Static method in class jdsl.core.ref.Assertion
Never use this method to indicate bad user input; this method is for asserting internal correctness of the implementation only.
check(boolean, String) - Static method in class jdsl.core.ref.Assertion
Never use this method to indicate bad user input; this method is for asserting internal correctness of the implementation only.
checkBeforeStart() - Method in class jdsl.core.ref.AbstractArrayIterator
 
checkDoubleRed(Position) - Method in class jdsl.core.ref.RedBlackTree
Takes O(logN) time -- where N = the number of locators in the tree and O(logN) = the height of the tree Check for double reds, then rotate or promote if necessary Protected for purposes of allowing snapshots during visualization
checkEmpty() - Method in class jdsl.core.ref.NodeCircularSequence
Simple convenience method to handle throwing an EmptyContainerException if the Sequence is empty.
checkPosition(Accessor) - Method in class jdsl.core.ref.NodeBinaryTree
Casts the accessor passed in to the appropriate node class for this container; also checks if it is null.
checkValidity(CircularSequence) - Method in class jdsl.core.ref.NodeCircularSequence
This is a convenience method that tests a CircularSequence for any condition which would cause invalidity, specifically : 1) it is null, 2) it is an incompatible type of CircularSequence, 3) the CircularSequence has been deliberately invalidated.
childAtRank(Position, int) - Method in interface jdsl.core.api.InspectableTree
 
childAtRank(Position, int) - Method in class jdsl.core.ref.NodeBinaryTree
O(1) time
childAtRank(Position, int) - Method in class jdsl.core.ref.NodeTree
O(1) time
children(Position) - Method in interface jdsl.core.api.InspectableTree
Returns an iterator over the children of the node in order.
children(Position) - Method in class jdsl.core.ref.NodeBinaryTree
O(1) time
children(Position) - Method in class jdsl.core.ref.NodeTree
O(1) time if cache exists, O(the number of children of the node) otherwise.
Circle2D - interface jdsl.geomobj.api.Circle2D.
This interface describes a two-dimensional circle.
CircularSequence - interface jdsl.core.api.CircularSequence.
A circular sequence stores elements in a ring, in other words it is a sequence without a head or a tail.
cleanup() - Method in class jdsl.graph.algo.DFS
Cleans up all decorations stored in the provided graph.
cleanup() - Method in class jdsl.graph.algo.AbstractTopologicalSort
Cleans up all decorations that this algorithm was storing in the provided graph.
cleanup() - Method in class jdsl.graph.algo.IntegerDijkstraTemplate
Removes the decorations from the vertices.
ClosedCurve2D - interface jdsl.geomobj.api.ClosedCurve2D.
Closed curves are curves that are closed and have a well-defined interior and exterior.
closer(Point2D, Point2D, Point2D) - Method in interface jdsl.geomobj.api.GeomSelector2D
 
closer(Point2D, Point2D, Point2D) - Method in class jdsl.geomobj.ref.GeomSelector2DImpl
 
closestAfter(Object) - Method in interface jdsl.core.api.InspectableOrderedDictionary
Returns the locator with smallest key greater than or equal to the search key.
closestAfter(Object) - Method in class jdsl.core.ref.ArraySkipList
Runs in expected O(log n) time, where n is the number of elements.
closestAfter(Object) - Method in class jdsl.core.ref.RedBlackTree
Takes O(logN) time -- traverses the height of the tree once.
closestBefore(Object) - Method in interface jdsl.core.api.InspectableOrderedDictionary
Returns the locator with largest key less than or equal to the search key.
closestBefore(Object) - Method in class jdsl.core.ref.ArraySkipList
Runs in expected O(log n) time, where n is the number of elements.
closestBefore(Object) - Method in class jdsl.core.ref.RedBlackTree
Takes O(logN) time -- traverses the height of the tree once.
COLLINEAR - Static variable in interface jdsl.geomobj.api.GeomTester2D
 
colorPromotion(Position, Position) - Method in class jdsl.core.ref.RedBlackTree
Takes O(logN) time -- where N = the number of locators in the tree and O(logN) = the height of the tree Do a color promotion and then check if colors are now wrong higher up Protected for purposes of allowing snapshots during visualization
ComparableComparator - class jdsl.core.ref.ComparableComparator.
Implementation of JDSL's Comparator interface in terms of the JDK's Comparable interface.
ComparableComparator() - Constructor for class jdsl.core.ref.ComparableComparator
 
Comparator - interface jdsl.core.api.Comparator.
Defines a total ordering for a set of objects.
ComparatorExtender - class jdsl.core.ref.ComparatorExtender.
Takes a java.util.Comparator and adapts it to the jdsl.core.api.Comparator.
ComparatorExtender(Comparator) - Constructor for class jdsl.core.ref.ComparatorExtender
Constructs a new comparator which adapts the given java.util.Comparator.
ComparatorReverser - class jdsl.core.ref.ComparatorReverser.
Takes a Comparator and reverses the ordering with respect to which the elements are compared.
ComparatorReverser(Comparator) - Constructor for class jdsl.core.ref.ComparatorReverser
 
compare(byte[], byte[]) - Method in class jdsl.core.ref.ByteArrayComparator
Compares two byte arrays.
compare(byte[], byte[]) - Method in class jdsl.core.ref.LexicographicalByteArrayComparator
This is the definition of lexicographic ordering.
compare(Object, Object) - Method in interface jdsl.core.api.Comparator
A C-style comparison function that returns a negative value if the first object is less than the second, a positive value if the second object is less, and 0 if the two objects are equal.
compare(Object, Object) - Method in class jdsl.core.ref.AbstractComparator
 
compare(Object, Object) - Method in class jdsl.core.ref.IntegerComparator
 
compare(Object, Object) - Method in class jdsl.core.ref.ByteArrayComparator
 
compare(Object, Object) - Method in class jdsl.core.ref.ComparatorReverser
 
compare(Object, Object) - Method in class jdsl.core.ref.BigIntegerComparator
 
compare(Object, Object) - Method in class jdsl.core.ref.ComparableComparator
Invokes the compareTo method of x1 on x2.
compare(Object, Object) - Method in class jdsl.core.ref.ComparatorExtender
Adapts the comparator method of the underlying comparator.
compareDistances(Point2D, Point2D, Point2D) - Method in interface jdsl.geomobj.api.ThreeArgsGeomTests2D
 
compareDistances(Point2D, Point2D, Point2D) - Method in class jdsl.geomobj.ref.GeomTester2DImpl
 
compareDistances(Point2D, Point2D, Point2D) - Method in class jdsl.geomobj.ref.IntRatRatGeomTests2D
 
compareDistances(Point2D, Point2D, Point2D) - Method in class jdsl.geomobj.ref.IntIntIntGeomTests2D
 
compareDistances(Point2D, Point2D, Point2D) - Method in class jdsl.geomobj.ref.RatRatRatGeomTests2D
 
compareDistances(Point2D, Point2D, Point2D) - Method in class jdsl.geomobj.ref.RatIntIntGeomTests2D
 
compareDistances(Point2D, Point2D, Point2D) - Method in class jdsl.geomobj.ref.IntIntRatGeomTests2D
 
compareDistances(Point2D, Point2D, Point2D) - Method in class jdsl.geomobj.ref.RatIntRatGeomTests2D
 
compareSlopes(LinearCurve2D, LinearCurve2D) - Method in interface jdsl.geomobj.api.TwoArgsGeomTests2D
 
compareSlopes(LinearCurve2D, LinearCurve2D) - Method in class jdsl.geomobj.ref.GeomTester2DImpl
 
compareSlopes(LinearCurve2D, LinearCurve2D) - Method in class jdsl.geomobj.ref.RatIntGeomTests2D
 
compareSlopes(LinearCurve2D, LinearCurve2D) - Method in class jdsl.geomobj.ref.IntRatGeomTests2D
 
compareSlopes(LinearCurve2D, LinearCurve2D) - Method in class jdsl.geomobj.ref.RatRatGeomTests2D
 
compareSlopes(LinearCurve2D, LinearCurve2D) - Method in class jdsl.geomobj.ref.IntIntGeomTests2D
 
computeCenter() - Method in class jdsl.geomobj.ref.AbstractCircle2D
 
computeCenter() - Method in class jdsl.geomobj.ref.RatCircle2D
Computes the center of the circle as the point simultaneously equidistant from p1_ and p2_, and from p2_ and p3_
computeCenter() - Method in class jdsl.geomobj.ref.IntCircle2D
 
computeSingleIntersection(IntPoint2D, IntPoint2D, IntPoint2D, IntPoint2D) - Method in class jdsl.geomobj.ref.GeomConstructor2DImpl
 
computeSqRadius() - Method in class jdsl.geomobj.ref.AbstractCircle2D
 
computeSqRadius() - Method in class jdsl.geomobj.ref.RatCircle2D
 
computeSqRadius() - Method in class jdsl.geomobj.ref.IntCircle2D
 
connectingEdges(Face, Face) - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
connectingEdges(Face, Face) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(min(degree(f1),degree(f2)))
connectingEdges(Vertex, Vertex) - Method in interface jdsl.graph.api.InspectableGraph
Gives all edges connecting two vertices.
connectingEdges(Vertex, Vertex) - Method in class jdsl.graph.ref.AbstractGraph
Built on incidentEdges(.)
ConnectivityViolationException - exception jdsl.map.api.ConnectivityViolationException.
This exception gets thrown when an action will make a graph that is by its nature connected become disconnected.
ConnectivityViolationException(String) - Constructor for class jdsl.map.api.ConnectivityViolationException
 
Container - interface jdsl.core.api.Container.
The common interface for all the mutable containers in JDSL.
container() - Method in class jdsl.core.ref.NodeBinaryTree.NBTNode
O(1) time
container() - Method in class jdsl.core.ref.NodeBinaryTree.NBTSuperNode
 
contains(Accessor) - Method in interface jdsl.core.api.InspectableContainer
Checks whether this container contains accessor a
contains(Accessor) - Method in class jdsl.core.ref.ArraySkipList
Runs in O(1) time.
contains(Accessor) - Method in class jdsl.core.ref.RedBlackTree
Takes O(1) time
contains(Accessor) - Method in class jdsl.core.ref.NodeCircularSequence
O(1)
contains(Accessor) - Method in class jdsl.core.ref.HashtableDictionary
O(1)
contains(Accessor) - Method in class jdsl.core.ref.ArrayHeap
time complexity = worst-case O(1)
contains(Accessor) - Method in class jdsl.core.ref.ArraySequence
O(1) time.
contains(Accessor) - Method in class jdsl.core.ref.NodeBinaryTree
O(1) time
contains(Accessor) - Method in class jdsl.core.ref.NodeSequence
O(1) time
contains(Accessor) - Method in class jdsl.core.ref.NodeTree
O(1) time
contains(Accessor) - Method in class jdsl.graph.ref.InspectableSubgraph
O(1)
contains(Accessor) - Method in class jdsl.graph.ref.IncidenceListGraph
O(1)
contains(Accessor) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
contains(Accessor) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
contract(Position) - Method in interface jdsl.core.api.Tree
Replaces a node with its children in the appropriate order.
contract(Position) - Method in class jdsl.core.ref.NodeTree
O(1) time
convert(Object) - Method in class jdsl.core.ref.BigIntegerToByteArray
 
convert(Object) - Method in interface jdsl.core.ref.ToByteArray
 
Converter - class jdsl.core.util.Converter.
Provides for conversion of JDSL data structures to java.util Collections and Java base types and for conversion of java.util Collections to JDSL data structures.
Converter() - Constructor for class jdsl.core.util.Converter
 
CoreException - exception jdsl.core.api.CoreException.
This is the class from which all exceptions of the core package are descended.
CoreException() - Constructor for class jdsl.core.api.CoreException
 
CoreException(String) - Constructor for class jdsl.core.api.CoreException
 
createDual() - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
Allows overriding this class to create a modified dual.
CROSS_EDGE - Static variable in class jdsl.graph.algo.DFS
Constant signifying that a marked edge is a cross edge.
CROSS_EDGE - Static variable in class jdsl.graph.algo.BFS
Constant signifying that an edge stored in markedEdges is a cross edge.
Curve2D - interface jdsl.geomobj.api.Curve2D.
Interface describing a simple curve, that is a curve that does not intersect itself.
cut(Position) - Method in interface jdsl.core.api.Tree
Cuts this tree above the given node, and replaces this position with an external node with a null element.
cut(Position) - Method in interface jdsl.core.api.BinaryTree
Position node and all its children are removed from this binary tree and replaced with a new external node with a null element.
cut(Position) - Method in class jdsl.core.ref.NodeBinaryTree
Takes O(S) time, where S is the number of positions in the subtree to cut
cut(Position) - Method in class jdsl.core.ref.NodeTree
O(size of the cut subtree) time
cycleStart_ - Variable in class jdsl.graph.algo.DirectedFindCycleDFS
The Vertex which has been encountered twice on one path, proving that a cycle exists.
cycleStart_ - Variable in class jdsl.graph.algo.FindCycleDFS
The Vertex which has been encountered twice on one path, proving that a cycle exists.

D

DBFS - class jdsl.graph.algo.DBFS.
Class extending BFS to create a directed Breadth First Search.
DBFS() - Constructor for class jdsl.graph.algo.DBFS
 
Decorable - interface jdsl.core.api.Decorable.
Decorability is the ability to attach extra pieces of information to an object.
DEFAULT_MAX_LEVEL - Static variable in class jdsl.core.ref.ArraySkipList
Default maximum level of node.
defaultInitialCapacity - Static variable in class jdsl.core.ref.ArrayHeap
 
degree(Face) - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
degree(Face) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
degree(Vertex) - Method in interface jdsl.graph.api.InspectableGraph
Gives the degree of a vertex, counting both directed and undirected edges.
degree(Vertex) - Method in class jdsl.graph.ref.InspectableSubgraph
This runs in time proportional to the running time of the corresponding method in the graph around which this subgraph wraps.
degree(Vertex) - Method in class jdsl.graph.ref.IncidenceListGraph
O(1)
degree(Vertex) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
degree(Vertex) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
degree(Vertex, int) - Method in interface jdsl.graph.api.InspectableGraph
Gives the degree of a vertex, counting all edges of the specified type.
degree(Vertex, int) - Method in class jdsl.graph.ref.InspectableSubgraph
This runs in time proportional to the running time of the corresponding method in the graph around which this subgraph wraps.
degree(Vertex, int) - Method in class jdsl.graph.ref.IncidenceListGraph
O(degree)
degree(Vertex, int) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(degree(v))
degree(Vertex, int) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(degree)
depth(Vertex) - Method in class jdsl.graph.algo.BFS
 
destination(Edge) - Method in interface jdsl.graph.api.InspectableGraph
 
destination(Edge) - Method in class jdsl.graph.ref.InspectableSubgraph
O(1)
destination(Edge) - Method in class jdsl.graph.ref.IncidenceListGraph
O(1)
destination(Edge) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
destination(Edge) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
destination(Vertex, Edge) - Method in class jdsl.graph.algo.IntegerPrimTemplate
Can be overridden to supply the destination of an edge, although I can't think of any reason to do so.
destination(Vertex, Edge) - Method in class jdsl.graph.algo.IntegerDijkstraTemplate
Can be overridden to supply the destination of an edge, although I can't think of any reason to do so.
destroy(Object) - Method in interface jdsl.core.api.Decorable
Removes the (attribute, value) entry associated with a certain attribute, attr, from the decorable object.
destroy(Object) - Method in class jdsl.core.ref.HashtableDecorable
Destroys a decoration.
destroy(Object) - Method in class jdsl.graph.api.Edge.NONEEdge
 
destroy(Object) - Method in class jdsl.graph.api.Vertex.NONEVertex
 
destroy(Object) - Method in class jdsl.map.api.Face.NONEFace
 
DFS - class jdsl.graph.algo.DFS.
Class implementing an abstract Depth First Search.
DFS() - Constructor for class jdsl.graph.algo.DFS
 
dfsVisit(Vertex) - Method in class jdsl.graph.algo.DFS
Performs a recursive depth-first search starting at v
Dictionary - interface jdsl.core.api.Dictionary.
A container that accepts (key,element) pairs and allows later lookup of the element associated with a particular key.
dictionaryToMap(InspectableDictionary, Map) - Static method in class jdsl.core.util.Converter
Places the contents of a dictionary into a map
dictionaryToSortedMap(InspectableDictionary, SortedMap) - Static method in class jdsl.core.util.Converter
Places the contents of a dictionary into a sorted map
dim() - Method in interface jdsl.geomobj.api.GeomObject
 
dim() - Method in class jdsl.geomobj.api.Point2D.InfinitePoint2D
 
dim() - Method in class jdsl.geomobj.api.GeomObject2D.NoneGeomObject2D
 
dim() - Method in class jdsl.geomobj.ref.AbstractGeomObject2D
 
dir_ - Variable in class jdsl.geomobj.ref.AbstractRealLinearCurve2D
 
dir_ - Variable in class jdsl.geomobj.ref.AbstractIntLinearCurve2D
 
dir_ - Variable in class jdsl.geomobj.ref.AbstractRatLinearCurve2D
 
DirectedDFS - class jdsl.graph.algo.DirectedDFS.
 
DirectedDFS() - Constructor for class jdsl.graph.algo.DirectedDFS
 
directedEdges() - Method in interface jdsl.graph.api.InspectableGraph
 
directedEdges() - Method in class jdsl.graph.ref.AbstractGraph
Built on edges() and isDirected(.)
DirectedFindCycleDFS - class jdsl.graph.algo.DirectedFindCycleDFS.
This class specializes DFS to determine if the connected component of the start vertex contains a cycle and if so return it.
DirectedFindCycleDFS() - Constructor for class jdsl.graph.algo.DirectedFindCycleDFS
Simple constructor initializes instance variables.
direction() - Method in interface jdsl.geomobj.api.LinearCurve2D
 
direction() - Method in class jdsl.geomobj.ref.AbstractRealLinearCurve2D
 
direction() - Method in class jdsl.geomobj.ref.AbstractIntLinearCurve2D
 
direction() - Method in class jdsl.geomobj.ref.AbstractRatLinearCurve2D
 
Direction2D - interface jdsl.geomobj.api.Direction2D.
This interface describes a two-dimensional direction.
DISCOVERY_EDGE - Static variable in class jdsl.graph.algo.BFS
Constant signifying that an edge stored in markedEdges is a discovery edge.
distance(Vertex) - Method in class jdsl.graph.algo.IntegerDijkstraTemplate
Returns the distance of a vertex from the source.
done_ - Variable in class jdsl.graph.algo.DirectedFindCycleDFS
This is set to true if a cycle is found, alerting the DFS to finish early
done_ - Variable in class jdsl.graph.algo.FindCycleDFS
This is set to true if a cycle is found, alerting the DFS to finish early
doOneIteration() - Method in class jdsl.graph.algo.IntegerPrimTemplate
Can be called manually to single-step the algorithm, but you must call init(.) before the first call to this method.
doOneIteration() - Method in class jdsl.graph.algo.IntegerDijkstraTemplate
Can be called manually to single-step the algorithm, but you must call init(.) before the first call to this method.
DOUBLEBLACK - Static variable in class jdsl.core.ref.RedBlackTree
 
dual_ - Variable in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
The dual of this graph
DUAL_INDEX - Static variable in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
 
dual() - Method in interface jdsl.map.api.EmbeddedPlanarGraph
 
dual() - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
 
dual(Edge) - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
dual(Edge) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
dual(Face) - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
dual(Face) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
dual(Vertex) - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
dual(Vertex) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
dualIndex_ - Variable in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
 

E

Edge - interface jdsl.graph.api.Edge.
Empty, typing interface for Positions that are edges.
edge_in_rt_style - Static variable in class jdsl.graph.ref.ToString
 
EDGE_TYPE - Static variable in class jdsl.graph.algo.DFS
Constant used as key to look up an edge's type.
Edge.NONEEdge - class jdsl.graph.api.Edge.NONEEdge.
A dummy class, used to implement the constant Edge.NONE
.
edge() - Method in interface jdsl.graph.api.EdgeIterator
 
edge() - Method in class jdsl.graph.ref.EdgeIteratorAdapter
 
EdgeDirection - interface jdsl.graph.api.EdgeDirection.
Interface containing constants for specifying which edges are desired in graph-query methods.
EdgeIterator - interface jdsl.graph.api.EdgeIterator.
Iterator over a set of edges.
EdgeIteratorAdapter - class jdsl.graph.ref.EdgeIteratorAdapter.
Takes an ObjectIterator known to be iterating over things that are edges, and makes it appear as an EdgeIterator.
EdgeIteratorAdapter(ObjectIterator) - Constructor for class jdsl.graph.ref.EdgeIteratorAdapter
 
edgeRelaxed(Vertex, int, Edge, int, Vertex, int) - Method in class jdsl.graph.algo.IntegerDijkstraTemplate
Can be overridden in any application where the edges considered for the shortest-path tree matter.
edges_ - Variable in class jdsl.graph.algo.IntegerPrimTreeBuilder
 
edges() - Method in interface jdsl.graph.api.InspectableGraph
 
edges() - Method in class jdsl.graph.ref.InspectableSubgraph
O(E in subgraph )
edges() - Method in class jdsl.graph.ref.IncidenceListGraph
O(E)
edges() - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(m)
edges() - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(m)
element() - Method in interface jdsl.core.api.LocatorIterator
Shortcut for locator().element().
element() - Method in interface jdsl.core.api.PositionIterator
Shortcut for position().element().
element() - Method in class jdsl.core.api.InspectableDictionary.InvalidLocator
 
element() - Method in interface jdsl.core.api.Accessor
Gets the element currently associated with this accessor.
element() - Method in class jdsl.core.ref.AbstractArrayIterator
 
element() - Method in class jdsl.core.ref.InOrderIterator
Takes O(1) time
element() - Method in class jdsl.core.ref.PostOrderIterator
Takes O(1) time
element() - Method in class jdsl.core.ref.NodeBinaryTree.NBTNode
O(1) time
element() - Method in class jdsl.core.ref.NodeBinaryTree.NBTSuperNode
Should never be called
element() - Method in class jdsl.core.ref.PreOrderIterator
Takes O(1) time
element() - Method in class jdsl.core.ref.NodeSequence.FNSNode
 
element() - Method in class jdsl.graph.api.Edge.NONEEdge
 
element() - Method in class jdsl.graph.api.Vertex.NONEVertex
 
element() - Method in class jdsl.graph.ref.EdgeIteratorAdapter
 
element() - Method in class jdsl.graph.ref.VertexIteratorAdapter
 
element() - Method in class jdsl.map.api.Face.NONEFace
 
element() - Method in class jdsl.map.ref.FaceIteratorAdapter
 
elements() - Method in interface jdsl.core.api.InspectableContainer
Returns an iterator over all the elements stored in this container.
elements() - Method in class jdsl.core.ref.ArraySkipList
Runs in O(n) time, where n is the number of elements.
elements() - Method in class jdsl.core.ref.RedBlackTree
Takes O(N) time from the need to iterate through the tree during snapshot -- where N= the number of locators in the tree Could very easily be cached; not sure that would be useful
elements() - Method in class jdsl.core.ref.NodeCircularSequence
O(1) if the structure and elements do not change, O(N) otherwise.
elements() - Method in class jdsl.core.ref.HashtableDictionary
O(1) if structure *AND* elements haven't changed, O(N) otherwise.
elements() - Method in class jdsl.core.ref.ArrayHeap
Cached for constant factor efficiency.
elements() - Method in class jdsl.core.ref.ArraySequence
O(1) time if the cache already exists.
elements() - Method in class jdsl.core.ref.NodeBinaryTree
Takes O(N) time from the need to iterate through the tree during snapshot, where N is the number of elements in the tree
elements() - Method in class jdsl.core.ref.NodeSequence
O(1) time if the cache already exists Otherwise O(N) to construct it
elements() - Method in class jdsl.core.ref.NodeTree
O(1) time if cache already exists, O(size of the tree) otherwise
elements() - Method in class jdsl.graph.ref.InspectableSubgraph
Runs in time proportional to vertices() + elements() in the subgraph.
elements() - Method in class jdsl.graph.ref.IncidenceListGraph
O(V+E)
elements() - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(n+m+l)
elements() - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(n+m)
EmbeddedPlanarGraph - interface jdsl.map.api.EmbeddedPlanarGraph.
An interface describing an embedded planar graph.
EmptyContainerException - exception jdsl.core.api.EmptyContainerException.
An EmptyContainerException indicates that the Container can't fulfill the requested operation because it is empty.
EmptyContainerException(String) - Constructor for class jdsl.core.api.EmptyContainerException
 
endVertices(Edge) - Method in interface jdsl.graph.api.InspectableGraph
 
endVertices(Edge) - Method in class jdsl.graph.ref.InspectableSubgraph
 
endVertices(Edge) - Method in class jdsl.graph.ref.IncidenceListGraph
O(1)
endVertices(Edge) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
endVertices(Edge) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
EQUAL - Static variable in interface jdsl.geomobj.api.GeomTester2D
 
EqualityComparator - interface jdsl.core.api.EqualityComparator.
This interface defines an equality comparison on a set of objects.
equals(Object) - Method in class jdsl.geomobj.api.Point2D.InfinitePoint2D
 
equals(Object) - Method in class jdsl.geomobj.ref.IntSegment2D
 
equals(Object) - Method in class jdsl.geomobj.ref.RatLine2D
 
equals(Object) - Method in class jdsl.geomobj.ref.RealDirection2D
 
equals(Object) - Method in class jdsl.geomobj.ref.RatDirection2D
 
equals(Object) - Method in class jdsl.geomobj.ref.RealSegment2D
 
equals(Object) - Method in class jdsl.geomobj.ref.RealPoint2D
 
equals(Object) - Method in class jdsl.geomobj.ref.IntRectangle2D
 
equals(Object) - Method in class jdsl.geomobj.ref.RatCircle2D
 
equals(Object) - Method in class jdsl.geomobj.ref.IntRay2D
 
equals(Object) - Method in class jdsl.geomobj.ref.IntPoint2D
 
equals(Object) - Method in class jdsl.geomobj.ref.RatPoint2D
 
equals(Object) - Method in class jdsl.geomobj.ref.IntLine2D
 
equals(Object) - Method in class jdsl.geomobj.ref.RatSegment2D
 
equals(Object) - Method in class jdsl.geomobj.ref.RatRectangle2D
 
equals(Object) - Method in class jdsl.geomobj.ref.IntCircle2D
 
equals(Object) - Method in class jdsl.geomobj.ref.IntDirection2D
 
equals(Object) - Method in class jdsl.geomobj.ref.RatRay2D
 
equals(Object) - Method in class jdsl.geomobj.ref.RealLine2D
 
equals(Object) - Method in class jdsl.geomobj.ref.RealRay2D
 
EulerTour - class jdsl.core.algo.traversals.EulerTour.
The EulerTour algorithm is a tree traversal that can be informally described as a walk around tree T, where we start by going from the root towards its left child, viewing the edges of T as being "walls" that we always keep to our left.
EulerTour() - Constructor for class jdsl.core.algo.traversals.EulerTour
The constructor for the algorithm.
execute(InspectableGraph) - Method in class jdsl.graph.algo.DFS
Execute a DFS without specifying an initial source vertex.
execute(InspectableGraph) - Method in class jdsl.graph.algo.AbstractTopologicalSort
The client calls this method to execute the algorithm.
execute(InspectableGraph, Vertex) - Method in class jdsl.graph.algo.DFS
Runs the depth first search algorithm on a graph.
execute(InspectableGraph, Vertex) - Method in class jdsl.graph.algo.IntegerDijkstraTemplate
The easiest way to use the algorithm is to use this method.
execute(InspectableGraph, Vertex) - Method in class jdsl.graph.algo.DirectedFindCycleDFS
 
execute(InspectableGraph, Vertex) - Method in class jdsl.graph.algo.FindCycleDFS
 
execute(InspectableGraph, Vertex, Object) - Method in class jdsl.graph.algo.BFS
Executes a breadth first search (BFS).
execute(InspectableGraph, Vertex, Vertex) - Method in class jdsl.graph.algo.IntegerDijkstraPathfinder
 
execute(InspectableTree) - Method in class jdsl.core.algo.traversals.EulerTour
This method should be called after construction.
executeAll(InspectableGraph, Vertex) - Method in class jdsl.graph.algo.IntegerPrimTemplate
Just like the other version of executeAll(.), but with infinity=Integer.MAX_VALUE
executeAll(InspectableGraph, Vertex, int) - Method in class jdsl.graph.algo.IntegerPrimTemplate
The easiest way to use the algorithm is to use this method.
expand() - Method in class jdsl.core.ref.NodeBinaryTree.NBTNode
O(1) time Expands this node into an internal node Asserts if this node is external
expand() - Method in class jdsl.core.ref.NodeBinaryTree.NBTSuperNode
Should never be called
expand(Position, Position, Object) - Method in interface jdsl.core.api.Tree
Replaces a set of consecutive children with a new node having those children as its children in the appropriate order.
expand(Position, Position, Object) - Method in class jdsl.core.ref.NodeTree
O(number of children of a new node) time
expandExternal(Position) - Method in interface jdsl.core.api.BinaryTree
The external position specified is transformed into an internal, and it gains two external children.
expandExternal(Position) - Method in class jdsl.core.ref.NodeBinaryTree
O(1) time

F

Face - interface jdsl.map.api.Face.
Empty, typing interface for faces.
Face.NONEFace - class jdsl.map.api.Face.NONEFace.
A dummy class, used to implement the constant Face.NONE
.
Face.NONEFace() - Constructor for class jdsl.map.api.Face.NONEFace
 
face() - Method in interface jdsl.map.api.FaceIterator
 
face() - Method in class jdsl.map.ref.FaceIteratorAdapter
 
FaceIterator - interface jdsl.map.api.FaceIterator.
Iterator over a set of faces.
FaceIteratorAdapter - class jdsl.map.ref.FaceIteratorAdapter.
Takes an ObjectIterator known to be iterating over things that are Faces, and makes it appear as a FaceIterator.
FaceIteratorAdapter(ObjectIterator) - Constructor for class jdsl.map.ref.FaceIteratorAdapter
 
faces() - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
faces() - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(l)
farther(Point2D, Point2D, Point2D) - Method in interface jdsl.geomobj.api.GeomSelector2D
 
farther(Point2D, Point2D, Point2D) - Method in class jdsl.geomobj.ref.GeomSelector2DImpl
 
find(Object) - Method in interface jdsl.core.api.InspectableDictionary
Finds an object that is mapped to a particular key.
find(Object) - Method in class jdsl.core.ref.ArraySkipList
Runs in expected O(log n) time, where n is the number of elements finds first node within skip list with key.
find(Object) - Method in class jdsl.core.ref.RedBlackTree
Takes O(logN) time -- where N = the number of locators in the tree and O(logN) = the height of the tree Takes the time to traverse the tree's height, which is O(logN)
find(Object) - Method in class jdsl.core.ref.HashtableDictionary
O(1) -- expected, O(N) worst case with excessive chaining.
findAll(Object) - Method in interface jdsl.core.api.InspectableDictionary
Finds all elements mapped to a particular key.
findAll(Object) - Method in class jdsl.core.ref.ArraySkipList
Runs in expected O(log n + m) time where n is the total number of elements and m is the number of elements with key value equal to key.
findAll(Object) - Method in class jdsl.core.ref.RedBlackTree
Takes O(logN+R) time -- where N = the number of locators in the tree and O(logN) = the height of the tree, and R = the number of instances of key in the tree O(log N) for one element; in theory, for each element, taking its inorder prev or next may take up to O(log N).
findAll(Object) - Method in class jdsl.core.ref.HashtableDictionary
O(#elts with target key), worst case O(N)
FindCycleDFS - class jdsl.graph.algo.FindCycleDFS.
This class specializes DFS to determine if the connected component of the start vertex contains a cycle and if so return it.
FindCycleDFS() - Constructor for class jdsl.graph.algo.FindCycleDFS
Simple constructor initializes instance variables.
FINISH_TIME - Static variable in class jdsl.graph.algo.DFS
Constant used as key to look up the finish time of a vertex.
finishTime(Vertex) - Method in class jdsl.graph.algo.DFS
Returns the "Finish time" of a Vertex.
finishVisit(Vertex) - Method in class jdsl.graph.algo.DFS
Called when the search has finished with the vertex.
finishVisit(Vertex) - Method in class jdsl.graph.algo.BFS
Abstract method called on a vertex at the end of a visit (after all of its untraversed edges have been traversed).
finishVisit(Vertex) - Method in class jdsl.graph.algo.DirectedFindCycleDFS
Once the visit has ended, they are removed from the prospective cyclic path.
finishVisit(Vertex) - Method in class jdsl.graph.algo.FindCycleDFS
Once the visit has ended, they are removed from the prospective cyclic path.
first() - Method in interface jdsl.core.api.InspectableSequence
The first position of the sequence.
first() - Method in interface jdsl.core.api.InspectableOrderedDictionary
Returns the Locator that is sequentially before any other Locator in this Container.
first() - Method in class jdsl.core.ref.ArraySkipList
Runs in O(1) time.
first() - Method in class jdsl.core.ref.RedBlackTree
Takes O(log N) time to traverse the height of the tree where N is the number of locators in the tree and O(logN) is the height of the tree
first() - Method in class jdsl.core.ref.ArraySequence
O(1) time.
first() - Method in class jdsl.core.ref.PostOrderIterator
Takes O(1) time Sets the current node to the first node.
first() - Method in class jdsl.core.ref.NodeSequence
O(1) time
firstChild(Position) - Method in interface jdsl.core.api.InspectableTree
 
firstChild(Position) - Method in class jdsl.core.ref.NodeBinaryTree
O(1) time
firstChild(Position) - Method in class jdsl.core.ref.NodeTree
O(1) time
FORWARD_EDGE - Static variable in class jdsl.graph.algo.DFS
Constant signifying that a marked edge is a forward edge.
FullContainerException - exception jdsl.core.ref.FullContainerException.
A FullContainerException indicates that the Container can't fulfill the requested operation because it is full.
FullContainerException(String) - Constructor for class jdsl.core.ref.FullContainerException
 

G

G - Variable in class jdsl.graph.algo.IntegerPrimTemplate
 
g_ - Variable in class jdsl.graph.algo.IntegerDijkstraTemplate
 
GeomConstructor2D - interface jdsl.geomobj.api.GeomConstructor2D.
A collection of methods that construct geometric objects.
GeomConstructor2DImpl - class jdsl.geomobj.ref.GeomConstructor2DImpl.
Default implementation of the GeomConstructor2D interface.
GeomConstructor2DImpl() - Constructor for class jdsl.geomobj.ref.GeomConstructor2DImpl
 
GeomException - exception jdsl.geomobj.api.GeomException.
 
GeomException(String) - Constructor for class jdsl.geomobj.api.GeomException
 
GeomObject - interface jdsl.geomobj.api.GeomObject.
Every geometric object interface inherits from this interface.
GeomObject2D - interface jdsl.geomobj.api.GeomObject2D.
Typing interface
GeomObject2D.NoneGeomObject2D - class jdsl.geomobj.api.GeomObject2D.NoneGeomObject2D.
A nested class used to implement the constant NONE.
GeomSelector2D - interface jdsl.geomobj.api.GeomSelector2D.
A collection of methods for choosing a geometric object according to the result of a geometric test.
GeomSelector2DImpl - class jdsl.geomobj.ref.GeomSelector2DImpl.
Default implementation of the GeomSelector2D interface
GeomSelector2DImpl() - Constructor for class jdsl.geomobj.ref.GeomSelector2DImpl
 
GeomTester2D - interface jdsl.geomobj.api.GeomTester2D.
A collection of geometric tests.
GeomTester2DImpl - class jdsl.geomobj.ref.GeomTester2DImpl.
Default implementation of the GeomTester2D interface.
GeomTester2DImpl() - Constructor for class jdsl.geomobj.ref.GeomTester2DImpl
 
get(Object) - Method in interface jdsl.core.api.Decorable
Returns the value in the (attribute, value) entry associated with a certain attribute, attr, in this decorable object.
get(Object) - Method in class jdsl.core.ref.HashtableDecorable
Gets the value of a decoration.
get(Object) - Method in class jdsl.graph.api.Edge.NONEEdge
 
get(Object) - Method in class jdsl.graph.api.Vertex.NONEVertex
 
get(Object) - Method in class jdsl.map.api.Face.NONEFace
 
getCycle() - Method in class jdsl.graph.algo.DirectedFindCycleDFS
Returns an ObjectIterator containing all of the Vertices in the found cycle.
getCycle() - Method in class jdsl.graph.algo.FindCycleDFS
Returns an ObjectIterator containing all of the Vertices in the found cycle.
getEdgeToParent(Vertex) - Method in class jdsl.graph.algo.IntegerDijkstraTemplate
Can be overridden to supply a way of storing and retrieving one edge per vertex.
getLocator(Vertex) - Method in class jdsl.graph.algo.IntegerPrimTemplate
Can be overridden to supply a way of storing and retrieving one locator per vertex.
getLocator(Vertex) - Method in class jdsl.graph.algo.IntegerDijkstraTemplate
Can be overridden to supply a way of storing and retrieving one locator per vertex.
graftOnLeft(Position, Object, BinaryTree) - Method in interface jdsl.core.api.BinaryTree
Position subtreeRoot of this binary tree is demoted one level, with all the positions and elements unchanged, and becomes the right child of a new node storing the given element.
graftOnLeft(Position, Object, BinaryTree) - Method in class jdsl.core.ref.NodeBinaryTree
Takes O(S) time, where S is the number of positions in the new subtree to graft on You are only allowed to link in and replaceSubtree with other instances of NodeBinaryTree (or subclasses thereof)
graftOnRight(Position, Object, BinaryTree) - Method in interface jdsl.core.api.BinaryTree
Position subtreeRoot of this binary tree is demoted one level, with all the positions and elements unchanged, and becomes the left child of a new node, storing the given element.
graftOnRight(Position, Object, BinaryTree) - Method in class jdsl.core.ref.NodeBinaryTree
Takes O(S) time, where S is the number of positions in the new subtree to graft on You are only allowed to link in and replaceSubtree with other instances of NodeBinaryTree (or subclasses thereof)
graph - Variable in class jdsl.graph.algo.BFS
The graph on which the algorithm is currently executing.
Graph - interface jdsl.graph.api.Graph.
An interface describing a combinatorial graph.
graph_ - Variable in class jdsl.graph.algo.DFS
The graph being traversed.
graph_ - Variable in class jdsl.graph.algo.AbstractTopologicalSort
The Graph that the algorithm executes upon.
GraphException - exception jdsl.graph.api.GraphException.
Class that is superclass for all exceptions in jdsl.graph.api package.
GraphException(String) - Constructor for class jdsl.graph.api.GraphException
 
GREATER - Static variable in interface jdsl.geomobj.api.GeomTester2D
 
gt - Static variable in class jdsl.geomobj.ref.AbstractGeomObject2D
 

H

has(Object) - Method in interface jdsl.core.api.Decorable
Tests whether there is an (attribute, value) entry associated with a certain attribute in this decorable object.
has(Object) - Method in class jdsl.core.ref.HashtableDecorable
Tests if a decoration exists.
has(Object) - Method in class jdsl.graph.api.Edge.NONEEdge
 
has(Object) - Method in class jdsl.graph.api.Vertex.NONEVertex
 
has(Object) - Method in class jdsl.map.api.Face.NONEFace
 
hash(Object) - Method in class jdsl.core.ref.HashtableDecorable
Gets the hashcode for a particular object.
HashComparator - interface jdsl.core.api.HashComparator.
This interface provides a way of mapping any object in a set to an integer, for purposes of implementing hash tables.
HashtableDecorable - class jdsl.core.ref.HashtableDecorable.
An implementation of Decorable using a hashtable.
HashtableDecorable() - Constructor for class jdsl.core.ref.HashtableDecorable
 
HashtableDictionary - class jdsl.core.ref.HashtableDictionary.
An implementation of Dictionary using a chaining hashtable.
HashtableDictionary(HashComparator) - Constructor for class jdsl.core.ref.HashtableDictionary
This constructor takes a Comparator which can determine if it can compare a key, and if two keys are equal, nothing more.
HashtableDictionary(HashComparator, int) - Constructor for class jdsl.core.ref.HashtableDictionary
This constructor takes a Comparator which can determine if it can compare a key, and if two keys are equal, nothing more, and an integer denoting the initial capacity.
hashValue(Object) - Method in interface jdsl.core.api.HashComparator
Returns the hash code value to be used for the object in this comparator.
hashValue(Object) - Method in class jdsl.core.ref.IntegerHashComparator
defines a mapping f: Integer -> \mathbb{Z} \cap [0, 2^{31} -1]
hashValue(Object) - Method in class jdsl.core.ref.ObjectHashComparator
 
hasNext() - Method in interface jdsl.core.api.ObjectIterator
 
hasNext() - Method in class jdsl.core.ref.AbstractArrayIterator
 
hasNext() - Method in class jdsl.core.ref.ArrayObjectIterator
Takes O(1) time
hasNext() - Method in class jdsl.core.ref.InOrderIterator
Takes O(1) time
hasNext() - Method in class jdsl.core.ref.PostOrderIterator
Takes O(1) time
hasNext() - Method in class jdsl.core.ref.PreOrderIterator
Takes O(1) time
hasNext() - Method in class jdsl.graph.ref.EdgeIteratorAdapter
 
hasNext() - Method in class jdsl.graph.ref.VertexIteratorAdapter
 
hasNext() - Method in class jdsl.graph.ref.AbstractGraph.OO_to_O_MergerIterator
 
hasNext() - Method in class jdsl.map.ref.FaceIteratorAdapter
 
HeapSort - class jdsl.core.algo.sorts.HeapSort.
Performs a heap-sort in O(n log n) time, provided only that the replaceElement(.) method of the Sequence works in O(1) time (and thus the style of implementation of the Sequence is not relevant).
HeapSort() - Constructor for class jdsl.core.algo.sorts.HeapSort
 

I

iCurrentIndex_ - Variable in class jdsl.core.ref.AbstractArrayIterator
 
iCurrentIndex_ - Variable in class jdsl.core.ref.ArrayObjectIterator
 
iLastIndex_ - Variable in class jdsl.core.ref.AbstractArrayIterator
 
iLastIndex_ - Variable in class jdsl.core.ref.ArrayObjectIterator
 
IN - Static variable in interface jdsl.graph.api.EdgeDirection
 
IncidenceListGraph - class jdsl.graph.ref.IncidenceListGraph.
An implementation of the Graph interface, including self-loops, parallel edges, and mixed directed and undirected edges.
IncidenceListGraph() - Constructor for class jdsl.graph.ref.IncidenceListGraph
Creates a new IncidenceListGraph with default parameters.
IncidenceListOrderedGraph - class jdsl.map.ref.IncidenceListOrderedGraph.
Implements the OrderedGraph interface by a list of vertices, each of which has a circular sequence of edges.
IncidenceListOrderedGraph() - Constructor for class jdsl.map.ref.IncidenceListOrderedGraph
 
incidentEdge(Face, Order, Edge, Vertex) - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
incidentEdge(Face, Order, Edge, Vertex) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1) Implemented through the dual graph
incidentEdge(Vertex, Order, Edge, Face) - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
incidentEdge(Vertex, Order, Edge, Face) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
incidentEdges(Face) - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
incidentEdges(Face) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(degree(f))
incidentEdges(Vertex) - Method in class jdsl.graph.algo.IntegerPrimTemplate
Can be overridden in any application where the default choice of edges to consider at any vertex is not satisfactory.
incidentEdges(Vertex) - Method in class jdsl.graph.algo.IntegerDijkstraTemplate
Can be overridden in any application where the default choice of edges to consider at any vertex is not satisfactory.
incidentEdges(Vertex) - Method in interface jdsl.graph.api.InspectableGraph
 
incidentEdges(Vertex) - Method in class jdsl.graph.ref.InspectableSubgraph
This runs in time proportional to the running time of the corresponding method in the graph around which this subgraph wraps.
incidentEdges(Vertex) - Method in class jdsl.graph.ref.IncidenceListGraph
O(degree)
incidentEdges(Vertex) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(degree(v))
incidentEdges(Vertex) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(degree)
incidentEdges(Vertex, int) - Method in interface jdsl.graph.api.InspectableGraph
 
incidentEdges(Vertex, int) - Method in class jdsl.graph.ref.InspectableSubgraph
This runs in time proportional to the running time of the corresponding method in the graph around which this subgraph wraps.
incidentEdges(Vertex, int) - Method in class jdsl.graph.ref.IncidenceListGraph
O(degree)
incidentEdges(Vertex, int) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(degree(v))
incidentEdges(Vertex, int) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(degree)
incidentFace(Vertex, Order, Edge) - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
incidentFace(Vertex, Order, Edge) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
 
incidentFaces(Edge) - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
incidentFaces(Edge) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
incidentFaces(Vertex) - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
incidentFaces(Vertex) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(degree(v))
incidentVertex(Face, Order, Edge) - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
incidentVertex(Face, Order, Edge) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
 
incidentVertices(Face) - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
incidentVertices(Face) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(degree(f))
INFINITE - Static variable in interface jdsl.geomobj.api.Point2D
 
INFINITE - Static variable in class jdsl.geomobj.ref.AbstractLinearCurve2D
 
INFINITY - Variable in class jdsl.graph.algo.IntegerPrimTemplate
 
init() - Method in class jdsl.core.algo.traversals.EulerTour
Called in execute(.), before algorithm is executed.
init(InspectableGraph) - Method in class jdsl.graph.algo.AbstractTopologicalSort
This helper method is called by the execute(.) method.
init(InspectableGraph, Vertex) - Method in class jdsl.graph.algo.IntegerDijkstraTemplate
Called automatically by executeAll(); must be called by the client prior to the first call to doOneIteration() if finer-grained control of the algorithm is needed.
init(InspectableGraph, Vertex, int) - Method in class jdsl.graph.algo.IntegerPrimTemplate
Called automatically by executeAll(); must be called by the client prior to the first call to doOneIteration() if finer-grained control of the algorithm is needed.
init(InspectableGraph, Vertex, int) - Method in class jdsl.graph.algo.IntegerPrimTreeBuilder
 
initialize(Vertex, Object) - Method in class jdsl.graph.algo.BFS
Abstract method to initialize the object at the beginning of a BFS execution.
initMap() - Method in class jdsl.graph.algo.IntegerPrimTemplate
Can be overridden to initialize a locator-lookup data structure of your choosing, but the default implementation, which uses a java.util.Hashtable, is probably sufficient for most purposes.
initMap() - Method in class jdsl.graph.algo.IntegerDijkstraTemplate
Can be overridden to initialize a locator-lookup data structure of your choosing, but the default implementation, which decorates each vertex with its locator, is probably sufficient for most purposes.
InOrderIterator - class jdsl.core.ref.InOrderIterator.
The inorder iterator gives an inorder iteration of a binary tree.
InOrderIterator(InspectableBinaryTree) - Constructor for class jdsl.core.ref.InOrderIterator
Constructs a new InOrderIterator to iterate over the given container Puts a reference to each position into the array -- takes O(N) time where N = the number of positions in the container (given assumptions discussed in header)
insert(Object, Object) - Method in interface jdsl.core.api.KeyBasedContainer
Inserts a (key,element) pair into this container.
insert(Object, Object) - Method in class jdsl.core.ref.ArraySkipList
Runs in expected O(log n) time, where n is the number of elements in the skip list.
insert(Object, Object) - Method in class jdsl.core.ref.RedBlackTree
Takes O(logN) time -- where N = the number of locators in the tree and O(logN) = the height of the tree The worst-case insertion would restructure once each step up the tree.
insert(Object, Object) - Method in class jdsl.core.ref.HashtableDictionary
O(1) expected, O(N) if insertion pushes the size above the rehashing threshhold.
insert(Object, Object) - Method in class jdsl.core.ref.ArrayHeap
If the array is full, its capacity is doubled before the insertion by copying the elements into a new array.
insertAfter(Position, Object) - Method in interface jdsl.core.api.CircularSequence
Inserts an element after a given position.
insertAfter(Position, Object) - Method in interface jdsl.core.api.Sequence
Inserts an object after a position in the sequence.
insertAfter(Position, Object) - Method in class jdsl.core.ref.NodeCircularSequence
O(1)
insertAfter(Position, Object) - Method in class jdsl.core.ref.ArraySequence
This method also clears the Position and element caches.
insertAfter(Position, Object) - Method in class jdsl.core.ref.NodeSequence
This method also clears the position cache.
insertAfterSibling(Position, Object) - Method in interface jdsl.core.api.Tree
Inserts a new sibling after a given node
insertAfterSibling(Position, Object) - Method in class jdsl.core.ref.NodeTree
O(1) time
insertAtRank(int, Object) - Method in interface jdsl.core.api.Sequence
Inserts based on an integer rank similar to array indices.
insertAtRank(int, Object) - Method in class jdsl.core.ref.ArraySequence
This method also clears the Position and element caches.
insertAtRank(int, Object) - Method in class jdsl.core.ref.NodeSequence
This method also clears the position cache.
insertBefore(Position, Object) - Method in interface jdsl.core.api.CircularSequence
Inserts an element before a given position.
insertBefore(Position, Object) - Method in interface jdsl.core.api.Sequence
Inserts an object before a position in the sequence.
insertBefore(Position, Object) - Method in class jdsl.core.ref.NodeCircularSequence
O(1)
insertBefore(Position, Object) - Method in class jdsl.core.ref.ArraySequence
This method also clears the Position and element caches.
insertBefore(Position, Object) - Method in class jdsl.core.ref.NodeSequence
This method also clears the position cache.
insertBeforeSibling(Position, Object) - Method in interface jdsl.core.api.Tree
Inserts a new sibling before a given node.
insertBeforeSibling(Position, Object) - Method in class jdsl.core.ref.NodeTree
O(1) time
insertChildAtRank(Position, int, Object) - Method in interface jdsl.core.api.Tree
Inserts a new child of node at the specified rank.
insertChildAtRank(Position, int, Object) - Method in class jdsl.core.ref.NodeTree
O(the number of children of the node) time
insertDirectedEdge(Vertex, Order, Edge, Vertex, Order, Edge, Face, Object) - Method in interface jdsl.map.api.EmbeddedPlanarGraph
Inserts a new directed edge from an existing origin vertex to an existing destination vertex in a specified order; the two vertices must be incident on a common face.
insertDirectedEdge(Vertex, Order, Edge, Vertex, Order, Edge, Face, Object) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
 
insertDirectedEdge(Vertex, Order, Edge, Vertex, Order, Edge, Object) - Method in interface jdsl.map.api.OrderedGraph
Inserts a new directed edge from an existing vertex to another in a specified order.
insertDirectedEdge(Vertex, Order, Edge, Vertex, Order, Edge, Object) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
insertDirectedEdge(Vertex, Vertex, Object) - Method in interface jdsl.graph.api.Graph
Inserts a new directed edge from an existing vertex to another.
insertDirectedEdge(Vertex, Vertex, Object) - Method in class jdsl.graph.ref.IncidenceListGraph
O(1)
insertDirectedEdge(Vertex, Vertex, Object) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
 
insertEdge(Vertex, Order, Edge, Vertex, Order, Edge, Face, Object) - Method in interface jdsl.map.api.EmbeddedPlanarGraph
Inserts a new edge between two existing vertices in a specified order; the two vertices must be incident with a common face.
insertEdge(Vertex, Order, Edge, Vertex, Order, Edge, Face, Object) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(degree(face)), where face is the face split by the insertion of the new edge
insertEdge(Vertex, Order, Edge, Vertex, Order, Edge, Object) - Method in interface jdsl.map.api.OrderedGraph
Inserts a new edge between two existing vertices in a specified order.
insertEdge(Vertex, Order, Edge, Vertex, Order, Edge, Object) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
insertEdge(Vertex, Vertex, Object) - Method in interface jdsl.graph.api.Graph
Inserts a new undirected edge between two existing vertices.
insertEdge(Vertex, Vertex, Object) - Method in class jdsl.graph.ref.IncidenceListGraph
O(1)
insertEdge(Vertex, Vertex, Object) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
 
insertFirst(Object) - Method in interface jdsl.core.api.Sequence
Inserts an object as first element of the sequence
insertFirst(Object) - Method in class jdsl.core.ref.ArraySequence
This method also clears the Position and element caches.
insertFirst(Object) - Method in class jdsl.core.ref.NodeSequence
This method also clears the position cache.
insertFirstChild(Position, Object) - Method in interface jdsl.core.api.Tree
Inserts a new child of node as the first child.
insertFirstChild(Position, Object) - Method in class jdsl.core.ref.NodeTree
O(1) time
insertInitial(Object) - Method in interface jdsl.core.api.CircularSequence
Inserts a given element into an empty circular sequence.
insertInitial(Object) - Method in class jdsl.core.ref.NodeCircularSequence
O(1)
insertLast(Object) - Method in interface jdsl.core.api.Sequence
Inserts an object as last element of the sequence.
insertLast(Object) - Method in class jdsl.core.ref.ArraySequence
This method also clears the Position and element caches.
insertLast(Object) - Method in class jdsl.core.ref.NodeSequence
This method also clears the position cache.
insertLastChild(Position, Object) - Method in interface jdsl.core.api.Tree
Inserts a new child of node as the last child.
insertLastChild(Position, Object) - Method in class jdsl.core.ref.NodeTree
O(1) time
insertVertex(Object) - Method in interface jdsl.graph.api.Graph
Inserts a new isolated vertex.
insertVertex(Object) - Method in class jdsl.graph.ref.IncidenceListGraph
O(1)
insertVertex(Object) - Method in interface jdsl.map.api.OrderedGraph
Inserts a new isolated vertex.
insertVertex(Object) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
INSIDE - Static variable in interface jdsl.geomobj.api.GeomTester2D
 
insideOutside(Point2D, Circle2D) - Method in interface jdsl.geomobj.api.TwoArgsGeomTests2D
 
insideOutside(Point2D, Circle2D) - Method in class jdsl.geomobj.ref.GeomTester2DImpl
 
insideOutside(Point2D, Circle2D) - Method in class jdsl.geomobj.ref.RatIntGeomTests2D
 
insideOutside(Point2D, Circle2D) - Method in class jdsl.geomobj.ref.IntRatGeomTests2D
 
insideOutside(Point2D, Circle2D) - Method in class jdsl.geomobj.ref.RatRatGeomTests2D
 
insideOutside(Point2D, Circle2D) - Method in class jdsl.geomobj.ref.IntIntGeomTests2D
 
insideOutside(Point2D, Rectangle2D) - Method in interface jdsl.geomobj.api.GeomTester2D
 
insideOutside(Point2D, Rectangle2D) - Method in class jdsl.geomobj.ref.GeomTester2DImpl
 
InspectableBinaryTree - interface jdsl.core.api.InspectableBinaryTree.
Please refer to the documentation of the BinaryTree interface.
inspectableBinaryTree() - Method in class jdsl.core.ref.RedBlackTree
Used for visualization and testers
inspectableBinaryTree() - Method in class jdsl.core.ref.ArrayHeap
Creates an InspectableBinaryTree snapshot view of the heap.
InspectableCircularSequence - interface jdsl.core.api.InspectableCircularSequence.
Please refer to the documentation of CircularSequence.
InspectableContainer - interface jdsl.core.api.InspectableContainer.
A "read only" interface to a container; please see Container for more details.
InspectableDictionary - interface jdsl.core.api.InspectableDictionary.
A read-only lookup structure; please refer to the documentation of Dictionary for more details.
InspectableDictionary.InvalidLocator - class jdsl.core.api.InspectableDictionary.InvalidLocator.
A locator that is always invalid.
InspectableDictionary.InvalidLocator() - Constructor for class jdsl.core.api.InspectableDictionary.InvalidLocator
 
InspectableDictionary.InvalidLocator(String) - Constructor for class jdsl.core.api.InspectableDictionary.InvalidLocator
 
inspectableDual() - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
inspectableDual() - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
InspectableEmbeddedPlanarGraph - interface jdsl.map.api.InspectableEmbeddedPlanarGraph.
An interface describing the accessor methods of an embedded planar graph.
InspectableGraph - interface jdsl.graph.api.InspectableGraph.
An interface describing the accessor methods of a combinatorial graph.
InspectableKeyBasedContainer - interface jdsl.core.api.InspectableKeyBasedContainer.
Please refer to the documentation of KeyBasedContainer.
InspectableOrderedDictionary - interface jdsl.core.api.InspectableOrderedDictionary.
A read-only lookup structure in which an ordering of the keys is maintained; please refer to the documentation of OrderedDictionary for more details.
InspectableOrderedGraph - interface jdsl.map.api.InspectableOrderedGraph.
An interface describing the accessor methods of an ordered graph.
InspectablePositionalContainer - interface jdsl.core.api.InspectablePositionalContainer.
Please refer to the documentation of PositionalContainer.
InspectableSequence - interface jdsl.core.api.InspectableSequence.
Please refer to the documentation of Sequence.
InspectableSubgraph - class jdsl.graph.ref.InspectableSubgraph.
This class represents a subgraph of an InspectableGraph.
InspectableSubgraph(InspectableGraph, EdgeIterator) - Constructor for class jdsl.graph.ref.InspectableSubgraph
Constructs the subgraph induced by the given edges.
InspectableSubgraph(InspectableGraph, VertexIterator) - Constructor for class jdsl.graph.ref.InspectableSubgraph
Constructs the subgraph induced by the given vertices.
InspectableTree - interface jdsl.core.api.InspectableTree.
Please refer to the documentation of Tree
IntCircle2D - class jdsl.geomobj.ref.IntCircle2D.
This is the class for a two-dimensional circle constructed using three integer points.
IntCircle2D(Point2D, Point2D, Point2D) - Constructor for class jdsl.geomobj.ref.IntCircle2D
 
IntDirection2D - class jdsl.geomobj.ref.IntDirection2D.
This is the class for a two-dimensional integer direction.
IntDirection2D(int, int) - Constructor for class jdsl.geomobj.ref.IntDirection2D
 
IntDirection2D(long, long) - Constructor for class jdsl.geomobj.ref.IntDirection2D
 
IntegerComparator - class jdsl.core.ref.IntegerComparator.
Compares java.lang.Integers.
IntegerComparator() - Constructor for class jdsl.core.ref.IntegerComparator
 
IntegerDijkstraPathfinder - class jdsl.graph.algo.IntegerDijkstraPathfinder.
Class that allows finding a path between two vertices of a graph, using Dijkstra's algorithm.
IntegerDijkstraPathfinder() - Constructor for class jdsl.graph.algo.IntegerDijkstraPathfinder
 
IntegerDijkstraTemplate - class jdsl.graph.algo.IntegerDijkstraTemplate.
Implementation of Dijkstra's algorithm using the template-method pattern: the core functionality is coded in a few final methods that call overridable methods to do some of the work.
IntegerDijkstraTemplate() - Constructor for class jdsl.graph.algo.IntegerDijkstraTemplate
 
IntegerHashComparator - class jdsl.core.ref.IntegerHashComparator.
An implementation of a HashComparator for java.lang.Integers
IntegerHashComparator() - Constructor for class jdsl.core.ref.IntegerHashComparator
 
IntegerPrimTemplate - class jdsl.graph.algo.IntegerPrimTemplate.
Implementation of the algorithm of Prim and Jarnik for finding a minimum spanning tree, using the template-method pattern: the core functionality is coded in a few final methods that call overridable methods to do some of the work.
IntegerPrimTemplate() - Constructor for class jdsl.graph.algo.IntegerPrimTemplate
 
IntegerPrimTreeBuilder - class jdsl.graph.algo.IntegerPrimTreeBuilder.
Constructs a full minimum spanning tree on a given graph and reports the tree as an iterator over the edges.
IntegerPrimTreeBuilder() - Constructor for class jdsl.graph.algo.IntegerPrimTreeBuilder
 
interestingEdges(Vertex) - Method in class jdsl.graph.algo.BFS
Abstract method that returns an iterator over those edges incident to the parameter vertex in the graph which should be considered for exploration.
interestingEdges(Vertex) - Method in class jdsl.graph.algo.DBFS
This implementation of interestingEdges(Vertex) returns all of the directed edges originating at the parameter Vertex.
interestingIncidentEdges(Vertex) - Method in class jdsl.graph.algo.DFS
A method that returns an iterator over those edges incident to the parameter vertex in the graph which should be considered for exploration.
interestingIncidentEdges(Vertex) - Method in class jdsl.graph.algo.DirectedDFS
This implementation of interestingEdges(Vertex) returns all of the directed edges originating at the parameter Vertex.
interestingIncidentEdges(Vertex) - Method in class jdsl.graph.algo.FindCycleDFS
This method tells the DFS which graph edges to check.
intersection(Line2D, Line2D) - Method in class jdsl.geomobj.ref.GeomTester2DImpl
 
intersection(Line2D, Ray2D) - Method in class jdsl.geomobj.ref.GeomTester2DImpl
 
intersection(Line2D, Segment2D) - Method in class jdsl.geomobj.ref.GeomTester2DImpl
 
intersection(LinearCurve2D, LinearCurve2D) - Method in interface jdsl.geomobj.api.GeomTester2D
Tests if two linear curves intersect.
intersection(LinearCurve2D, LinearCurve2D) - Method in class jdsl.geomobj.ref.GeomTester2DImpl
 
intersection(Ray2D, Ray2D) - Method in class jdsl.geomobj.ref.GeomTester2DImpl
 
intersection(Ray2D, Segment2D) - Method in class jdsl.geomobj.ref.GeomTester2DImpl
 
intersection(Segment2D, Segment2D) - Method in class jdsl.geomobj.ref.GeomTester2DImpl
 
intersectionGeomObject(IntLine2D, IntLine2D) - Method in class jdsl.geomobj.ref.GeomConstructor2DImpl
 
intersectionGeomObject(IntLine2D, IntRay2D) - Method in class jdsl.geomobj.ref.GeomConstructor2DImpl
 
intersectionGeomObject(IntLine2D, IntSegment2D) - Method in class jdsl.geomobj.ref.GeomConstructor2DImpl
 
intersectionGeomObject(IntRay2D, IntRay2D) - Method in class jdsl.geomobj.ref.GeomConstructor2DImpl
 
intersectionGeomObject(IntRay2D, IntSegment2D) - Method in class jdsl.geomobj.ref.GeomConstructor2DImpl
 
intersectionGeomObject(IntSegment2D, IntSegment2D) - Method in class jdsl.geomobj.ref.GeomConstructor2DImpl
 
intersectionGeomObject(Line2D, Line2D) - Method in class jdsl.geomobj.ref.GeomConstructor2DImpl
 
intersectionGeomObject(Line2D, Ray2D) - Method in class jdsl.geomobj.ref.GeomConstructor2DImpl
 
intersectionGeomObject(Line2D, Segment2D) - Method in class jdsl.geomobj.ref.GeomConstructor2DImpl
 
intersectionGeomObject(LinearCurve2D, LinearCurve2D) - Method in interface jdsl.geomobj.api.GeomConstructor2D
 
intersectionGeomObject(LinearCurve2D, LinearCurve2D) - Method in class jdsl.geomobj.ref.GeomConstructor2DImpl
 
intersectionGeomObject(Ray2D, Ray2D) - Method in class jdsl.geomobj.ref.GeomConstructor2DImpl
 
intersectionGeomObject(Ray2D, Segment2D) - Method in class jdsl.geomobj.ref.GeomConstructor2DImpl
 
intersectionGeomObject(Segment2D, Segment2D) - Method in class jdsl.geomobj.ref.GeomConstructor2DImpl
 
IntIntGeomTests2D - class jdsl.geomobj.ref.IntIntGeomTests2D.
Default implementation of interface TwoArgsGeomTests2D with integer arguments.
IntIntGeomTests2D() - Constructor for class jdsl.geomobj.ref.IntIntGeomTests2D
 
IntIntIntGeomTests2D - class jdsl.geomobj.ref.IntIntIntGeomTests2D.
Implementation of interface ThreeArgsGeomTests2D with integer arguments.
IntIntIntGeomTests2D() - Constructor for class jdsl.geomobj.ref.IntIntIntGeomTests2D
 
IntIntRatGeomTests2D - class jdsl.geomobj.ref.IntIntRatGeomTests2D.
Implementation of interface ThreeArgsGeomTests2D with integer first and second arguments, and rational third argument.
IntIntRatGeomTests2D() - Constructor for class jdsl.geomobj.ref.IntIntRatGeomTests2D
 
IntLine2D - class jdsl.geomobj.ref.IntLine2D.
IntLine2D is a Line2D constructed using either two integer points or an integer point and an integer direction.
IntLine2D(Point2D, Direction2D) - Constructor for class jdsl.geomobj.ref.IntLine2D
Creates a line passing through point p with direction dir.
IntLine2D(Point2D, Point2D) - Constructor for class jdsl.geomobj.ref.IntLine2D
Creates a line passing through points p1 and p2; the underlying direction is from p1 to p2.
IntPoint2D - class jdsl.geomobj.ref.IntPoint2D.
This is the class for a two-dimensional geometric point with integer coordinates.
IntPoint2D(int, int) - Constructor for class jdsl.geomobj.ref.IntPoint2D
 
IntPoint2D(long, long) - Constructor for class jdsl.geomobj.ref.IntPoint2D
 
IntRatGeomTests2D - class jdsl.geomobj.ref.IntRatGeomTests2D.
Default implementation of interface TwoArgsGeomTests2D with integer first argument and rational second argument.
IntRatGeomTests2D() - Constructor for class jdsl.geomobj.ref.IntRatGeomTests2D
 
IntRatRatGeomTests2D - class jdsl.geomobj.ref.IntRatRatGeomTests2D.
Implementation of interface ThreeArgsGeomTests2D with integer first argument, and rational second and third arguments.
IntRatRatGeomTests2D() - Constructor for class jdsl.geomobj.ref.IntRatRatGeomTests2D
 
IntRay2D - class jdsl.geomobj.ref.IntRay2D.
IntRay2D is a Ray2D constructed using either two distinct integer points or an integer point and an integer direction.
IntRay2D(Point2D, Direction2D) - Constructor for class jdsl.geomobj.ref.IntRay2D
Creates a ray emanating from point source with direction dir.
IntRay2D(Point2D, Point2D) - Constructor for class jdsl.geomobj.ref.IntRay2D
Creates a ray emanating from point source and passing through point other; the underlying direction is from source to other.
IntRectangle2D - class jdsl.geomobj.ref.IntRectangle2D.
This is the class for a two-dimensional rectangle constructed using two integer points.
IntRectangle2D(Point2D, Point2D) - Constructor for class jdsl.geomobj.ref.IntRectangle2D
 
IntSegment2D - class jdsl.geomobj.ref.IntSegment2D.
IntSegment2D is a Segment2D constructed using two distinct integer points.
IntSegment2D(Point2D, Point2D) - Constructor for class jdsl.geomobj.ref.IntSegment2D
Creates a segment passing with endpoints p1 and p2; the underlying direction is from p1 to p2.
intx() - Method in class jdsl.geomobj.ref.IntPoint2D
The direct use of this method is dicouraged; computations should be performed through methods of GeomTester2D.
intx() - Method in class jdsl.geomobj.ref.IntDirection2D
 
inty() - Method in class jdsl.geomobj.ref.IntPoint2D
The direct use of this method is dicouraged; computations should be performed through methods of GeomTester2D.
inty() - Method in class jdsl.geomobj.ref.IntDirection2D
 
InvalidAccessorException - exception jdsl.core.api.InvalidAccessorException.
Used when an accessor (position or locator) is invalid, either internally invalid or invalid with respect to a particular container.
InvalidAccessorException(String) - Constructor for class jdsl.core.api.InvalidAccessorException
 
InvalidAttributeException - exception jdsl.core.api.InvalidAttributeException.
Used when the key for an attribute lookup is not supported by the implementation's lookup mechanism.
InvalidAttributeException(String) - Constructor for class jdsl.core.api.InvalidAttributeException
 
InvalidCircleException - exception jdsl.geomobj.api.InvalidCircleException.
 
InvalidCircleException(String) - Constructor for class jdsl.geomobj.api.InvalidCircleException
 
InvalidContainerException - exception jdsl.core.api.InvalidContainerException.
Used to indicate that a container passed to a function is of the wrong type or otherwise invalid for that function call.
InvalidContainerException(String) - Constructor for class jdsl.core.api.InvalidContainerException
 
InvalidCoordinateException - exception jdsl.geomobj.api.InvalidCoordinateException.
 
InvalidCoordinateException(String) - Constructor for class jdsl.geomobj.api.InvalidCoordinateException
 
InvalidDirectionException - exception jdsl.geomobj.api.InvalidDirectionException.
 
InvalidDirectionException(String) - Constructor for class jdsl.geomobj.api.InvalidDirectionException
 
InvalidEdgeException - exception jdsl.graph.api.InvalidEdgeException.
An object of this class gets thrown when topological information related to Edges is somehow incorrect.
InvalidEdgeException(String) - Constructor for class jdsl.graph.api.InvalidEdgeException
 
InvalidFaceException - exception jdsl.map.api.InvalidFaceException.
 
InvalidFaceException(String) - Constructor for class jdsl.map.api.InvalidFaceException
 
InvalidGeomObjectException - exception jdsl.geomobj.api.InvalidGeomObjectException.
 
InvalidGeomObjectException(String) - Constructor for class jdsl.geomobj.api.InvalidGeomObjectException
 
InvalidGeomTestException - exception jdsl.geomobj.api.InvalidGeomTestException.
 
InvalidGeomTestException(String) - Constructor for class jdsl.geomobj.api.InvalidGeomTestException
 
InvalidKeyException - exception jdsl.core.api.InvalidKeyException.
Used when a key passed to a key-based container is not supported by the implementation's lookup mechanism.
InvalidKeyException(String) - Constructor for class jdsl.core.api.InvalidKeyException
 
InvalidLinearCurveException - exception jdsl.geomobj.api.InvalidLinearCurveException.
 
InvalidLinearCurveException(String) - Constructor for class jdsl.geomobj.api.InvalidLinearCurveException
 
InvalidMethodCallException - exception jdsl.core.api.InvalidMethodCallException.
Package jdsl.core.api
class InvalidMethodCallException
InvalidMethodCallException(String) - Constructor for class jdsl.core.api.InvalidMethodCallException
 
InvalidOrderException - exception jdsl.map.api.InvalidOrderException.
 
InvalidOrderException(String) - Constructor for class jdsl.map.api.InvalidOrderException
 
InvalidPointException - exception jdsl.geomobj.api.InvalidPointException.
 
InvalidPointException(String) - Constructor for class jdsl.geomobj.api.InvalidPointException
 
InvalidQueryException - exception jdsl.graph.algo.InvalidQueryException.
This exception is currently used only by the two subclasses of AbstractTopologicalSort.
InvalidQueryException(String) - Constructor for class jdsl.graph.algo.InvalidQueryException
 
InvalidVertexException - exception jdsl.graph.api.InvalidVertexException.
An object of this class gets thrown when topological information related to vertices is incorrect.
InvalidVertexException(String) - Constructor for class jdsl.graph.api.InvalidVertexException
 
is_cyclic_ - Variable in class jdsl.graph.algo.AbstractTopologicalSort
Whether the graph has cycles or not.
isBackEdge(Edge) - Method in class jdsl.graph.algo.DFS
Tests if an edge is a back edge.
isBlack(Position) - Method in class jdsl.core.ref.RedBlackTree
Returns whether or not the given position of the underlying tre is black; for visualization/testing purposes.
isComparable(Object) - Method in interface jdsl.core.api.EqualityComparator
Allows a container (or any client) to find out whether an object is a member of the ordered set over which this comparator is defined.
isComparable(Object) - Method in class jdsl.core.ref.IntegerComparator
 
isComparable(Object) - Method in class jdsl.core.ref.ByteArrayComparator
 
isComparable(Object) - Method in class jdsl.core.ref.ComparatorReverser
 
isComparable(Object) - Method in class jdsl.core.ref.BigIntegerComparator
 
isComparable(Object) - Method in class jdsl.core.ref.IntegerHashComparator
determines if the Comparator can use this Object
isComparable(Object) - Method in class jdsl.core.ref.ComparableComparator
 
isComparable(Object) - Method in class jdsl.core.ref.ObjectHashComparator
 
isComparable(Object) - Method in class jdsl.core.ref.ComparatorExtender
Tests if an object is comparator by asking the comparator if compare(o,o)
isCrossEdge(Edge) - Method in class jdsl.graph.algo.DFS
Tests if an edge is a cross edge.
isCrossEdge(Edge) - Method in class jdsl.graph.algo.BFS
 
isCyclic() - Method in class jdsl.graph.algo.AbstractTopologicalSort
Query method for asking whether the Graph is cyclic, (and therefore inappropriate for a topological ordering).
isDecreasing() - Method in interface jdsl.geomobj.api.LinearCurve2D
 
isDecreasing() - Method in class jdsl.geomobj.ref.AbstractLinearCurve2D
 
isDirected(Edge) - Method in interface jdsl.graph.api.InspectableGraph
 
isDirected(Edge) - Method in class jdsl.graph.ref.InspectableSubgraph
This runs in time proportional to the running time of the corresponding method in the graph around which this subgraph wraps.
isDirected(Edge) - Method in class jdsl.graph.ref.IncidenceListGraph
O(1)
isDirected(Edge) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
isDirected(Edge) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
isDiscoveryEdge(Edge) - Method in class jdsl.graph.algo.BFS
 
isDone() - Method in class jdsl.graph.algo.DFS
Tests if the depth first search is done.
isDone() - Method in class jdsl.graph.algo.DirectedFindCycleDFS
Returns true iff a cycle has been found.
isDone() - Method in class jdsl.graph.algo.FindCycleDFS
Returns true iff a cycle has been found.
isDoubleBlack(Position) - Method in class jdsl.core.ref.RedBlackTree
Returns whether or not the given position of the underlying tre is double-black; for visualization/testing purposes.
isDownward() - Method in interface jdsl.geomobj.api.Ray2D
 
isDownward() - Method in class jdsl.geomobj.ref.IntRay2D
 
isDownward() - Method in class jdsl.geomobj.ref.RatRay2D
 
isDownward() - Method in class jdsl.geomobj.ref.RealRay2D
 
isEmpty() - Method in interface jdsl.core.api.InspectableContainer
Checks whether this container holds zero elements.
isEmpty() - Method in class jdsl.core.ref.ArraySkipList
Runs in O(1) time.
isEmpty() - Method in class jdsl.core.ref.RedBlackTree
Takes O(1) time
isEmpty() - Method in class jdsl.core.ref.AbstractPositionalContainer
Checks if this container is empty.
isEmpty() - Method in class jdsl.core.ref.NodeCircularSequence
O(1)
isEmpty() - Method in class jdsl.core.ref.HashtableDictionary
O(1)
isEmpty() - Method in class jdsl.core.ref.ArrayHeap
time complexity = worst-case O(1)
isEmpty() - Method in class jdsl.core.ref.NodeBinaryTree
Overridden from AbstractPositionalContainer to be O(1) time.
isEmpty() - Method in class jdsl.core.ref.NodeTree
O(1) time
isEqualTo(Object, Object) - Method in interface jdsl.core.api.EqualityComparator
Tests the two parameter objects in the set over which the comparator is defined for equality.
isEqualTo(Object, Object) - Method in class jdsl.core.ref.AbstractComparator
 
isEqualTo(Object, Object) - Method in class jdsl.core.ref.IntegerHashComparator
tests equality on two Integers
isEqualTo(Object, Object) - Method in class jdsl.core.ref.ObjectHashComparator
returns x1.equals(x2)
isExternal(Position) - Method in interface jdsl.core.api.InspectableTree
Checks if a position is a leaf of this tree.
isExternal(Position) - Method in class jdsl.core.ref.NodeBinaryTree
O(1) time
isExternal(Position) - Method in class jdsl.core.ref.NodeTree
O(1) time
isFinished(Vertex) - Method in class jdsl.graph.algo.IntegerDijkstraTemplate
Tests whether a vertex has been reached.
isFirst(Position) - Method in interface jdsl.core.api.InspectableSequence
Check if the given position is the first.
isFirst(Position) - Method in class jdsl.core.ref.ArraySequence
O(1) time.
isFirst(Position) - Method in class jdsl.core.ref.NodeSequence
O(1) time
isForwardEdge(Edge) - Method in class jdsl.graph.algo.DFS
Tests if an edge is a forward edge.
isGreaterThan(Object, Object) - Method in interface jdsl.core.api.Comparator
Tests the strict order of two objects in the set over which this comparator is defined.
isGreaterThan(Object, Object) - Method in class jdsl.core.ref.AbstractComparator
 
isGreaterThanOrEqualTo(Object, Object) - Method in interface jdsl.core.api.Comparator
Tests non-strict order of two objects in the universe over which this comparator is defined.
isGreaterThanOrEqualTo(Object, Object) - Method in class jdsl.core.ref.AbstractComparator
 
isHorizontal() - Method in interface jdsl.geomobj.api.LinearCurve2D
 
isHorizontal() - Method in class jdsl.geomobj.ref.AbstractLinearCurve2D
 
isIncreasing() - Method in interface jdsl.geomobj.api.LinearCurve2D
 
isIncreasing() - Method in class jdsl.geomobj.ref.AbstractLinearCurve2D
 
isInternal() - Method in class jdsl.core.ref.NodeBinaryTree.NBTNode
O(1) time
isInternal() - Method in class jdsl.core.ref.NodeBinaryTree.NBTSuperNode
Should never be called
isInternal(Position) - Method in interface jdsl.core.api.InspectableTree
Checks if a position is an internal node of this tree.
isInternal(Position) - Method in class jdsl.core.ref.NodeBinaryTree
O(1) time
isInternal(Position) - Method in class jdsl.core.ref.NodeTree
O(1) time
isLast(Position) - Method in interface jdsl.core.api.InspectableSequence
Check if the given position is the last.
isLast(Position) - Method in class jdsl.core.ref.ArraySequence
O(1) time.
isLast(Position) - Method in class jdsl.core.ref.NodeSequence
O(1) time
isLeftChild() - Method in class jdsl.core.ref.NodeBinaryTree.NBTNode
O(1) time
isLeftward() - Method in interface jdsl.geomobj.api.Ray2D
 
isLeftward() - Method in class jdsl.geomobj.ref.IntRay2D
 
isLeftward() - Method in class jdsl.geomobj.ref.RatRay2D
 
isLeftward() - Method in class jdsl.geomobj.ref.RealRay2D
 
isLessThan(Object, Object) - Method in interface jdsl.core.api.Comparator
Tests the strict order of two objects in the set over which this comparator is defined.
isLessThan(Object, Object) - Method in class jdsl.core.ref.AbstractComparator
 
isLessThanOrEqualTo(Object, Object) - Method in interface jdsl.core.api.Comparator
Tests non-strict order of two objects in the universe over which this comparator is defined.
isLessThanOrEqualTo(Object, Object) - Method in class jdsl.core.ref.AbstractComparator
 
isMarked(Edge) - Method in class jdsl.graph.algo.BFS
 
isMarked(Vertex) - Method in class jdsl.graph.algo.BFS
 
isReachable(Vertex) - Method in class jdsl.graph.algo.IntegerDijkstraTemplate
Tests whether a vertex is reachable from the source.
isRed(Position) - Method in class jdsl.core.ref.RedBlackTree
Returns whether or not the given position of the underlying tre is red; for visualization/testing purposes.
isRightward() - Method in interface jdsl.geomobj.api.Ray2D
 
isRightward() - Method in class jdsl.geomobj.ref.IntRay2D
 
isRightward() - Method in class jdsl.geomobj.ref.RatRay2D
 
isRightward() - Method in class jdsl.geomobj.ref.RealRay2D
 
isRoot(Position) - Method in interface jdsl.core.api.InspectableTree
Checks if a position is the root of this tree.
isRoot(Position) - Method in class jdsl.core.ref.NodeBinaryTree
O(1) time
isRoot(Position) - Method in class jdsl.core.ref.NodeTree
O(1) time
isSuperNode() - Method in class jdsl.core.ref.NodeBinaryTree.NBTNode
Used to determine if this node is the super node
isSuperNode() - Method in class jdsl.core.ref.NodeBinaryTree.NBTSuperNode
Used to determine if this node is the super node (overridden)
isTreeEdge(Edge) - Method in class jdsl.graph.algo.DFS
Tests if an edge is a tree edge.
isUnseen(Edge) - Method in class jdsl.graph.algo.DFS
Tests if an edge has been seen yet.
isUnvisited(Vertex) - Method in class jdsl.graph.algo.DFS
Tests if a vertex has not been visited.
isUpward() - Method in interface jdsl.geomobj.api.Ray2D
 
isUpward() - Method in class jdsl.geomobj.ref.IntRay2D
 
isUpward() - Method in class jdsl.geomobj.ref.RatRay2D
 
isUpward() - Method in class jdsl.geomobj.ref.RealRay2D
 
isValid() - Method in class jdsl.core.ref.NodeBinaryTree.NBTSuperNode
Should never be called
isVertical() - Method in interface jdsl.geomobj.api.LinearCurve2D
 
isVertical() - Method in class jdsl.geomobj.ref.AbstractLinearCurve2D
 
isVisited(Vertex) - Method in class jdsl.graph.algo.DFS
Tests if a vertex has been visited.
isVisiting(Vertex) - Method in class jdsl.graph.algo.DFS
Tests if a vertex is being visited.
iteratorToDictionary(Iterator, Dictionary) - Static method in class jdsl.core.util.Converter
Places the contents of a java.util iterator into a dictionary
iteratorToList(ObjectIterator, List) - Static method in class jdsl.core.util.Converter
Places the contents of a JDSL iterator into a List, preserving order
iteratorToMap(ObjectIterator, Map) - Static method in class jdsl.core.util.Converter
Places the contents of a JDSL iterator into a Map
iteratorToPriorityQueue(Iterator, PriorityQueue) - Static method in class jdsl.core.util.Converter
Places the contents of a java.util iterator into a PQ
iteratorToSequence(Iterator, Sequence) - Static method in class jdsl.core.util.Converter
Places the contents of a java.util iterator into a sequence
iteratorToSet(ObjectIterator, Set) - Static method in class jdsl.core.util.Converter
Places the contents of a JDSL iterator into a Set

J

jdsl.core.algo.sorts - package jdsl.core.algo.sorts
Package of sorting algorithms that operate on Sequences (defined in jdsl.core.api).
jdsl.core.algo.traversals - package jdsl.core.algo.traversals
Package of traversal algorithms that operate on jdsl.core.api.InspectableTree objects.   A traversal algorithm performs operations while visiting the nodes of a tree.
jdsl.core.api - package jdsl.core.api
Package of interfaces and exceptions that compose the API for JDSL's core data structures: sequences, trees, priority queues, and dictionaries (a/k/a maps or associative arrays).
jdsl.core.ref - package jdsl.core.ref
Package of implementations of the interfaces in jdsl.core.api.
jdsl.core.util - package jdsl.core.util
Package that provides convenient conversions between data structure types, including those in java.util.
jdsl.geomobj.api - package jdsl.geomobj.api
This package contains interfaces for basic geometric objects, such as points, linear curves, rectangles, and circles, and for geometric testers and constructors.
jdsl.geomobj.ref - package jdsl.geomobj.ref
This package contains implementations of the interfaces in jdsl.geomobj.api.
jdsl.graph.algo - package jdsl.graph.algo
Package of basic graph algorithms, including algorithms for depth-first search, single-source shortest paths (Dijkstra's), topological sort (Knuth), and minimum spanning trees (Prim-Jarnik). 
jdsl.graph.api - package jdsl.graph.api
Package of container and accessor interfaces for graphs.   In general, developers should implement the InspectableGraph or ModifiableGraph interfaces, that provide descriptions of methods needed for most graph types.  The  interface defines the methods for the general graph type.
jdsl.graph.ref - package jdsl.graph.ref
Package of implementations of the interfaces in jdsl.graph.api.   The IncidenceListGraph class provides a very general graph implementation.   The package also contains Iterator types VertexIterator and EdgeIterator for iterating over Vertex and Edge accessors. 
jdsl.map.api - package jdsl.map.api
This package contains interfaces for Ordered Graphs and Embedded Planar Graphs.
jdsl.map.ref - package jdsl.map.ref
This package contains implementations of the interfaces in jdsl.map.api.
JdslNumber - class jdsl.geomobj.ref.JdslNumber.
All operations return downcasted Numbers (most efficient use of space) and take in downcasted input.
JdslNumber() - Constructor for class jdsl.geomobj.ref.JdslNumber
 
jn - Static variable in class jdsl.geomobj.ref.AbstractGeomObject2D
 

K

key() - Method in interface jdsl.core.api.Locator
 
key() - Method in interface jdsl.core.api.LocatorIterator
Shortcut for locator().key()
key() - Method in class jdsl.core.api.InspectableDictionary.InvalidLocator
 
key() - Method in class jdsl.core.ref.ArrayLocatorIterator
 
KeyBasedContainer - interface jdsl.core.api.KeyBasedContainer.
Key-based containers are containers that store (key,element) pairs; each pair is represented by a Locator.
keys() - Method in interface jdsl.core.api.InspectableKeyBasedContainer
Returns an iterator over all the keys stored in this container.
keys() - Method in class jdsl.core.ref.ArraySkipList
Runs in O(n) time, where n is the number of elements.
keys() - Method in class jdsl.core.ref.RedBlackTree
Takes O(N) time from the need to iterate through the tree during snapshot -- where N= the number of locators in the tree Could very easily be cached; not sure that would be useful
keys() - Method in class jdsl.core.ref.HashtableDictionary
O(1) if structure hasn't changed, O(N) otherwise.
keys() - Method in class jdsl.core.ref.ArrayHeap
Cached for constant factor efficiency.

L

last() - Method in interface jdsl.core.api.InspectableSequence
The last position of the sequence.
last() - Method in interface jdsl.core.api.InspectableOrderedDictionary
Returns the Locator that is sequentially after any other Locator in this Container.
last() - Method in class jdsl.core.ref.ArraySkipList
Runs in O(1) time.
last() - Method in class jdsl.core.ref.RedBlackTree
Takes O(log N) time to traverse the height of the tree where N is the number of locators in the tree and O(logN) is the height of the tree
last() - Method in class jdsl.core.ref.ArraySequence
O(1) time.
last() - Method in class jdsl.core.ref.NodeSequence
O(1) time
lastChild(Position) - Method in interface jdsl.core.api.InspectableTree
 
lastChild(Position) - Method in class jdsl.core.ref.NodeBinaryTree
O(1) time
lastChild(Position) - Method in class jdsl.core.ref.NodeTree
O(1) time
LEFT - Static variable in interface jdsl.geomobj.api.GeomTester2D
 
left_ - Variable in class jdsl.geomobj.ref.AbstractLinearCurve2D
 
LEFT_TURN - Static variable in interface jdsl.geomobj.api.GeomTester2D
 
left() - Method in class jdsl.core.ref.NodeBinaryTree.NBTNode
O(1) time
left() - Method in class jdsl.core.ref.NodeBinaryTree.NBTSuperNode
Should never be called
leftChild(Position) - Method in interface jdsl.core.api.InspectableBinaryTree
Provides the left child of a given node.
leftChild(Position) - Method in class jdsl.core.ref.NodeBinaryTree
O(1) time
leftFace(Edge) - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
leftFace(Edge) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
leftPoint() - Method in interface jdsl.geomobj.api.Segment2D
 
leftPoint() - Method in class jdsl.geomobj.ref.IntSegment2D
 
leftPoint() - Method in class jdsl.geomobj.ref.RealSegment2D
 
leftPoint() - Method in class jdsl.geomobj.ref.RatSegment2D
 
leftRight(Point2D, LinearCurve2D) - Method in interface jdsl.geomobj.api.GeomTester2D
 
leftRight(Point2D, LinearCurve2D) - Method in class jdsl.geomobj.ref.GeomTester2DImpl
 
leftRight(Point2D, Point2D) - Method in interface jdsl.geomobj.api.TwoArgsGeomTests2D
 
leftRight(Point2D, Point2D) - Method in class jdsl.geomobj.ref.GeomTester2DImpl
 
leftRight(Point2D, Point2D) - Method in class jdsl.geomobj.ref.RatIntGeomTests2D
 
leftRight(Point2D, Point2D) - Method in class jdsl.geomobj.ref.IntRatGeomTests2D
 
leftRight(Point2D, Point2D) - Method in class jdsl.geomobj.ref.RatRatGeomTests2D
 
leftRight(Point2D, Point2D) - Method in class jdsl.geomobj.ref.IntIntGeomTests2D
 
leftRightTurn(Point2D, Point2D, Point2D) - Method in interface jdsl.geomobj.api.ThreeArgsGeomTests2D
 
leftRightTurn(Point2D, Point2D, Point2D) - Method in class jdsl.geomobj.ref.GeomTester2DImpl
 
leftRightTurn(Point2D, Point2D, Point2D) - Method in class jdsl.geomobj.ref.IntRatRatGeomTests2D
 
leftRightTurn(Point2D, Point2D, Point2D) - Method in class jdsl.geomobj.ref.IntIntIntGeomTests2D
 
leftRightTurn(Point2D, Point2D, Point2D) - Method in class jdsl.geomobj.ref.RatRatRatGeomTests2D
 
leftRightTurn(Point2D, Point2D, Point2D) - Method in class jdsl.geomobj.ref.RatIntIntGeomTests2D
 
leftRightTurn(Point2D, Point2D, Point2D) - Method in class jdsl.geomobj.ref.IntIntRatGeomTests2D
 
leftRightTurn(Point2D, Point2D, Point2D) - Method in class jdsl.geomobj.ref.RatIntRatGeomTests2D
 
LESSER - Static variable in interface jdsl.geomobj.api.GeomTester2D
 
LexicographicalByteArrayComparator - class jdsl.core.ref.LexicographicalByteArrayComparator.
A Lexicographical comparator for byte arrays.
LexicographicalByteArrayComparator() - Constructor for class jdsl.core.ref.LexicographicalByteArrayComparator
 
Line2D - interface jdsl.geomobj.api.Line2D.
Lines are special open curves with infinite length.
LinearCurve2D - interface jdsl.geomobj.api.LinearCurve2D.
Lines are special open curves with infinite length.
link(Position, BinaryTree) - Method in interface jdsl.core.api.BinaryTree
Links binary tree newSubtree at external node node by replacing node with the root of newSubtree.
link(Position, BinaryTree) - Method in class jdsl.core.ref.NodeBinaryTree
Takes O(S) time, where S is the number of positions in this subtree You are only allowed to link in and replaceSubtree with other instances of NodeBinaryTree (or subclasses thereof)
link(Position, Tree) - Method in interface jdsl.core.api.Tree
Links tree t at external node extNode by replacing ExtNode with the root of t.
link(Position, Tree) - Method in class jdsl.core.ref.NodeTree
O(size of the new subtree to be linked in) time
ListMergeSort - class jdsl.core.algo.sorts.ListMergeSort.
Performs a merge-sort in O(n log n) time, provided that isEmpty(), first(), insertLast(), and removeFirst() all operate in O(1) time.
ListMergeSort() - Constructor for class jdsl.core.algo.sorts.ListMergeSort
 
ListQuickSort - class jdsl.core.algo.sorts.ListQuickSort.
Performs an in-place quicksort in expected O(n log n) time, provided that the first(), last(), after(), and before() methods of the Sequence work in O(1) time.
ListQuickSort() - Constructor for class jdsl.core.algo.sorts.ListQuickSort
 
listToSequence(List, Sequence) - Static method in class jdsl.core.util.Converter
Places the contents of a list into a sequence, preserving order
loc_to_collections_style_s - Static variable in class jdsl.core.ref.ToString
 
locArray_ - Variable in class jdsl.core.ref.ArrayLocatorIterator
 
Locator - interface jdsl.core.api.Locator.
A locator is a coat-check, of sorts, for a (key,element) pair inside a KeyBasedContainer.
locator() - Method in interface jdsl.core.api.LocatorIterator
 
locator() - Method in class jdsl.core.ref.ArrayLocatorIterator
 
LocatorIterator - interface jdsl.core.api.LocatorIterator.
Iterator over a set of locators.
locators - Variable in class jdsl.graph.algo.IntegerPrimTemplate
 
locators() - Method in interface jdsl.core.api.InspectableKeyBasedContainer
Allows access to all the locators stored by this container.
locators() - Method in class jdsl.core.ref.ArraySkipList
Runs in O(n) time, where n is the number of elements.
locators() - Method in class jdsl.core.ref.RedBlackTree
Takes O(N) time from the need to iterate through the tree during snapshot -- where N= the number of locators in the tree Could very easily be cached; not sure that would be useful
locators() - Method in class jdsl.core.ref.HashtableDictionary
O(1) if structure hasn't changed, O(N) otherwise.
locators() - Method in class jdsl.core.ref.ArrayHeap
Cached for constant factor efficiency.

M

main(String[]) - Static method in class jdsl.core.ref.BigIntegerToByteArray
 
main(String[]) - Static method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
 
makeUncontained() - Method in class jdsl.core.ref.NodeBinaryTree.NBTNode
O(1) time Makes this node uncontained
makeUncontained() - Method in class jdsl.core.ref.NodeBinaryTree.NBTSuperNode
Should never be called
makeUndirected(Edge) - Method in interface jdsl.graph.api.ModifiableGraph
Makes a directed edge undirected.
makeUndirected(Edge) - Method in class jdsl.graph.ref.IncidenceListGraph
O(1)
makeUndirected(Edge) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
makeUndirected(Edge) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
mapToDictionary(Map, Dictionary) - Static method in class jdsl.core.util.Converter
Places the contents of a map into a dictionary
mark(Edge, Object) - Method in class jdsl.graph.algo.BFS
Marks e as being of type kind.
mark(Vertex, int) - Method in class jdsl.graph.algo.BFS
Marks v as being of depth depth in the BFS tree created by this BFS.
MARKED - Static variable in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
 
midPoint(IntPoint2D, IntPoint2D) - Method in class jdsl.geomobj.ref.GeomConstructor2DImpl
 
midPoint(Point2D, Point2D) - Method in interface jdsl.geomobj.api.GeomConstructor2D
 
midPoint(Point2D, Point2D) - Method in class jdsl.geomobj.ref.GeomConstructor2DImpl
 
min() - Method in interface jdsl.core.api.PriorityQueue
Allows access to element with highest priority without removing it from the priority queue.
min() - Method in class jdsl.core.ref.ArrayHeap
time complexity = worst-case O(1)
ModifiableGraph - interface jdsl.graph.api.ModifiableGraph.
An interface describing the modifier methods of a combinatorial graph that can safely be inherited by more restricted graphs.
moveEndVertex(Edge, Vertex, Vertex, Order, Edge) - Method in interface jdsl.map.api.OrderedGraph
Moves one of the endvertices of an edge to an existing vertex by inserting the edge in a specified order.
moveEndVertex(Edge, Vertex, Vertex, Order, Edge) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
MULTIPLE - Static variable in interface jdsl.geomobj.api.GeomTester2D
 

N

NEGATIVE - Static variable in interface jdsl.geomobj.api.GeomTester2D
 
NEGATIVE - Static variable in class jdsl.geomobj.ref.AbstractLinearCurve2D
 
newContainer() - Method in interface jdsl.core.api.Container
Creates a new, empty container of the same class as this one (and therefore of the same interface as this one).
newContainer() - Method in class jdsl.core.ref.ArraySkipList
Runs in O(1 + t) time where t is the time it takes to create the head node.
newContainer() - Method in class jdsl.core.ref.RedBlackTree
Takes O(1) time
newContainer() - Method in class jdsl.core.ref.NodeCircularSequence
O(1)
newContainer() - Method in class jdsl.core.ref.HashtableDictionary
O(1)
newContainer() - Method in class jdsl.core.ref.ArrayHeap
time complexity = worst-case O(1)
newContainer() - Method in class jdsl.core.ref.ArraySequence
Returns an empty ArraySequence.
newContainer() - Method in class jdsl.core.ref.NodeBinaryTree
O(1) time
newContainer() - Method in class jdsl.core.ref.NodeSequence
 
newContainer() - Method in class jdsl.core.ref.NodeTree
O(1) time
newContainer() - Method in class jdsl.graph.ref.InspectableSubgraph
This method is unsupported.
newContainer() - Method in class jdsl.graph.ref.IncidenceListGraph
O(1)
newContainer() - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
newContainer() - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
newPQ() - Method in class jdsl.graph.algo.IntegerPrimTemplate
Can be overridden to supply a priority queue of your choosing, but the default implementation, which gives an empty jdsl.core.ref.ArrayHeap, is probably sufficient for most purposes.
newPQ() - Method in class jdsl.graph.algo.IntegerDijkstraTemplate
Can be overridden to supply a priority queue of your choosing, but the default implementation, which gives an empty jdsl.core.ref.ArrayHeap, is probably sufficient for most purposes.
nextAccessor() - Method in class jdsl.core.ref.AbstractArrayIterator
 
nextEdge() - Method in interface jdsl.graph.api.EdgeIterator
 
nextEdge() - Method in class jdsl.graph.ref.EdgeIteratorAdapter
 
nextFace() - Method in interface jdsl.map.api.FaceIterator
 
nextFace() - Method in class jdsl.map.ref.FaceIteratorAdapter
 
nextIncidentEdge(Vertex, Edge) - Method in interface jdsl.map.api.InspectableOrderedGraph
 
nextIncidentEdge(Vertex, Edge) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
nextIncidentEdge(Vertex, Edge, int) - Method in interface jdsl.map.api.InspectableOrderedGraph
 
nextIncidentEdge(Vertex, Edge, int) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(degree)
nextLocator() - Method in interface jdsl.core.api.LocatorIterator
 
nextLocator() - Method in class jdsl.core.ref.ArrayLocatorIterator
 
nextObject() - Method in interface jdsl.core.api.ObjectIterator
 
nextObject() - Method in class jdsl.core.ref.AbstractArrayIterator
Takes O(1) time
nextObject() - Method in class jdsl.core.ref.ArrayObjectIterator
Takes O(1) time
nextObject() - Method in class jdsl.core.ref.InOrderIterator
Takes O(1) time
nextObject() - Method in class jdsl.core.ref.PostOrderIterator
Takes O(1) time
nextObject() - Method in class jdsl.core.ref.PreOrderIterator
 
nextObject() - Method in class jdsl.graph.ref.EdgeIteratorAdapter
 
nextObject() - Method in class jdsl.graph.ref.VertexIteratorAdapter
 
nextObject() - Method in class jdsl.graph.ref.AbstractGraph.OO_to_O_MergerIterator
 
nextObject() - Method in class jdsl.map.ref.FaceIteratorAdapter
 
nextPosition() - Method in interface jdsl.core.api.PositionIterator
 
nextPosition() - Method in class jdsl.core.ref.ArrayPositionIterator
 
nextPosition() - Method in class jdsl.core.ref.InOrderIterator
Takes O(1) time
nextPosition() - Method in class jdsl.core.ref.PostOrderIterator
Takes O(1) time
nextPosition() - Method in class jdsl.core.ref.PreOrderIterator
Takes O(1) time
nextPosition() - Method in class jdsl.graph.ref.EdgeIteratorAdapter
 
nextPosition() - Method in class jdsl.graph.ref.VertexIteratorAdapter
 
nextPosition() - Method in class jdsl.map.ref.FaceIteratorAdapter
 
nextVertex() - Method in interface jdsl.graph.api.VertexIterator
 
nextVertex() - Method in class jdsl.graph.ref.VertexIteratorAdapter
 
NO - Static variable in interface jdsl.geomobj.api.GeomTester2D
 
NO_SUCH_KEY - Static variable in interface jdsl.core.api.InspectableDictionary
This Locator is returned when a method that should return a locator with a given key can find no such key within the data structure
NodeBinaryTree - class jdsl.core.ref.NodeBinaryTree.
A node-based Binary Tree.
NodeBinaryTree.NBTNode - class jdsl.core.ref.NodeBinaryTree.NBTNode.
This is the class for all user-visible nodes It contains links for its parent, children, and element.
NodeBinaryTree.NBTNode(NodeBinaryTree.NBTNode, Object) - Constructor for class jdsl.core.ref.NodeBinaryTree.NBTNode
make a new external node
NodeBinaryTree.NBTSuperNode - class jdsl.core.ref.NodeBinaryTree.NBTSuperNode.
This is the supernode.
NodeBinaryTree.NBTSuperNode(NodeBinaryTree, NodeBinaryTree.NBTNode) - Constructor for class jdsl.core.ref.NodeBinaryTree.NBTSuperNode
Constructs the super node with its tree and root
NodeBinaryTree() - Constructor for class jdsl.core.ref.NodeBinaryTree
Create a tree.
NodeBinaryTree(NodeBinaryTree.NBTNode) - Constructor for class jdsl.core.ref.NodeBinaryTree
Create a tree from a set of nodes.
NodeCircularSequence - class jdsl.core.ref.NodeCircularSequence.
A CircularSequence implemented with a linked list whose nodes are Positions.
NodeCircularSequence() - Constructor for class jdsl.core.ref.NodeCircularSequence
default Constructor for a NodeCircularSequence, the only one.
NodeSequence - class jdsl.core.ref.NodeSequence.
A Sequence based on a doubly-linked-list implementation.
NodeSequence.FNSNode - class jdsl.core.ref.NodeSequence.FNSNode.
This nested class is the node for NodeSequence.
NodeSequence.FNSNode(Object) - Constructor for class jdsl.core.ref.NodeSequence.FNSNode
Default constructor for the Node.
NodeSequence() - Constructor for class jdsl.core.ref.NodeSequence
The default constructor for NodeSequence, as well as the only one.
NodeTree - class jdsl.core.ref.NodeTree.
A node-based Tree.
NodeTree() - Constructor for class jdsl.core.ref.NodeTree
The default constructor for NodeTree, which creates a tree with one node whose element is null.
NONE - Static variable in interface jdsl.geomobj.api.GeomObject2D
 
NONE - Static variable in interface jdsl.graph.api.Edge
Used when a function requires an edge to be specified but there is no edge to specify, or when a function needs to return an edge but there is no edge to return.
NONE - Static variable in interface jdsl.graph.api.Vertex
Used when a function needs to return a vertex but there is no vertex to return.
NONE - Static variable in interface jdsl.map.api.Face
Used when a function requires a face to be specified but there is no face to specify, or when a function needs to return a face but there is no face to return.
NonEmptyContainerException - exception jdsl.core.api.NonEmptyContainerException.
A NonEmptyContainerException indicates that the Container can't fulfill the requested operation because it is not empty.
NonEmptyContainerException(String) - Constructor for class jdsl.core.api.NonEmptyContainerException
 
NoSuchEdgeException - exception jdsl.graph.api.NoSuchEdgeException.
An object of this class gets thrown when an Edge object with certain properties does not exist in the graph.
NoSuchEdgeException(String) - Constructor for class jdsl.graph.api.NoSuchEdgeException
 
NoSuchVertexException - exception jdsl.graph.api.NoSuchVertexException.
An object of this class gets thrown when a Vertex object with certain properties does not exist in the graph.
NoSuchVertexException(String) - Constructor for class jdsl.graph.api.NoSuchVertexException
 
NoUniqueResultException - exception jdsl.map.api.NoUniqueResultException.
 
NoUniqueResultException(String) - Constructor for class jdsl.map.api.NoUniqueResultException
 
NUMBER_KEY_ - Variable in class jdsl.graph.algo.AbstractTopologicalSort
This Object is the key for the numbering Decoration.
number(Vertex) - Method in class jdsl.graph.algo.AbstractTopologicalSort
Used for retrieving the topological order-number associated with the given Vertex.
numChildren(Position) - Method in interface jdsl.core.api.InspectableTree
 
numChildren(Position) - Method in class jdsl.core.ref.NodeBinaryTree
O(1) time Can be determined by the inherent nature of the type of node rather than by counting
numChildren(Position) - Method in class jdsl.core.ref.NodeTree
O(1) time
numEdges() - Method in interface jdsl.graph.api.InspectableGraph
 
numEdges() - Method in class jdsl.graph.ref.InspectableSubgraph
O(1)
numEdges() - Method in class jdsl.graph.ref.IncidenceListGraph
O(1)
numEdges() - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
numEdges() - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
numFaces() - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
numFaces() - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
numVertices() - Method in interface jdsl.graph.api.InspectableGraph
 
numVertices() - Method in class jdsl.graph.ref.InspectableSubgraph
O(1)
numVertices() - Method in class jdsl.graph.ref.IncidenceListGraph
O(1)
numVertices() - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
numVertices() - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
numw() - Method in class jdsl.geomobj.ref.RatDirection2D
 
numw() - Method in class jdsl.geomobj.ref.RatPoint2D
The direct use of this method is dicouraged; computations should be performed through methods of GeomTester2D.
numx() - Method in class jdsl.geomobj.ref.RatDirection2D
 
numx() - Method in class jdsl.geomobj.ref.RatPoint2D
The direct use of this method is dicouraged; computations should be performed through methods of GeomTester2D.
numy() - Method in class jdsl.geomobj.ref.RatDirection2D
 
numy() - Method in class jdsl.geomobj.ref.RatPoint2D
The direct use of this method is dicouraged; computations should be performed through methods of GeomTester2D.

O

object() - Method in interface jdsl.core.api.ObjectIterator
 
object() - Method in class jdsl.core.ref.AbstractArrayIterator
Takes O(1) time
object() - Method in class jdsl.core.ref.ArrayObjectIterator
Takes O(1) time
object() - Method in class jdsl.core.ref.InOrderIterator
Takes O(1) time
object() - Method in class jdsl.core.ref.PostOrderIterator
Takes O(1) time
object() - Method in class jdsl.core.ref.PreOrderIterator
 
object() - Method in class jdsl.graph.ref.EdgeIteratorAdapter
 
object() - Method in class jdsl.graph.ref.VertexIteratorAdapter
 
object() - Method in class jdsl.graph.ref.AbstractGraph.OO_to_O_MergerIterator
 
object() - Method in class jdsl.map.ref.FaceIteratorAdapter
 
ObjectHashComparator - class jdsl.core.ref.ObjectHashComparator.
Implements the JDSL HashComparator interface in terms of Java's native Object methods equals(.) and hashCode().
ObjectHashComparator() - Constructor for class jdsl.core.ref.ObjectHashComparator
 
ObjectIterator - interface jdsl.core.api.ObjectIterator.
Iterator over a set of objects.
ON - Static variable in interface jdsl.geomobj.api.GeomTester2D
 
OpenCurve2D - interface jdsl.geomobj.api.OpenCurve2D.
Open curves have two distinct end points to the curve.
opposite() - Method in interface jdsl.geomobj.api.Direction2D
 
opposite() - Method in class jdsl.geomobj.ref.RealDirection2D
 
opposite() - Method in class jdsl.geomobj.ref.RatDirection2D
 
opposite() - Method in class jdsl.geomobj.ref.IntDirection2D
 
opposite(Face, Edge) - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
opposite(Face, Edge) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
opposite(Vertex, Edge) - Method in interface jdsl.graph.api.InspectableGraph
 
opposite(Vertex, Edge) - Method in class jdsl.graph.ref.InspectableSubgraph
O(1)
opposite(Vertex, Edge) - Method in class jdsl.graph.ref.IncidenceListGraph
O(1)
opposite(Vertex, Edge) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
opposite(Vertex, Edge) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
Order - class jdsl.map.api.Order.
Specifies the order in which to insert new edges with respect to other edges.
OrderedDictionary - interface jdsl.core.api.OrderedDictionary.
A Dictionary in which the keys are totally ordered.
OrderedGraph - interface jdsl.map.api.OrderedGraph.
An interface describing an ordered graph.
origin(Edge) - Method in interface jdsl.graph.api.InspectableGraph
 
origin(Edge) - Method in class jdsl.graph.ref.InspectableSubgraph
O(1)
origin(Edge) - Method in class jdsl.graph.ref.IncidenceListGraph
O(1)
origin(Edge) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
origin(Edge) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
other() - Method in interface jdsl.geomobj.api.Ray2D
 
other() - Method in class jdsl.geomobj.ref.IntRay2D
 
other() - Method in class jdsl.geomobj.ref.RatRay2D
 
other() - Method in class jdsl.geomobj.ref.RealRay2D
 
otherChild(NodeBinaryTree.NBTNode) - Method in class jdsl.core.ref.NodeBinaryTree.NBTNode
O(1) time
otherChild(NodeBinaryTree.NBTNode) - Method in class jdsl.core.ref.NodeBinaryTree.NBTSuperNode
Should never be called
OUT - Static variable in interface jdsl.graph.api.EdgeDirection
 
OUTSIDE - Static variable in interface jdsl.geomobj.api.GeomTester2D
 

P

p_ - Variable in class jdsl.geomobj.ref.RealDirection2D
 
p_ - Variable in class jdsl.geomobj.ref.RatDirection2D
 
p_ - Variable in class jdsl.geomobj.ref.IntDirection2D
 
p1_ - Variable in class jdsl.geomobj.ref.AbstractRealLinearCurve2D
 
p1_ - Variable in class jdsl.geomobj.ref.AbstractIntLinearCurve2D
 
p1_ - Variable in class jdsl.geomobj.ref.AbstractRatLinearCurve2D
 
p1_ - Variable in class jdsl.geomobj.ref.RatCircle2D
 
p1_ - Variable in class jdsl.geomobj.ref.IntCircle2D
 
p2_ - Variable in class jdsl.geomobj.ref.AbstractRealLinearCurve2D
 
p2_ - Variable in class jdsl.geomobj.ref.AbstractIntLinearCurve2D
 
p2_ - Variable in class jdsl.geomobj.ref.AbstractRatLinearCurve2D
 
p2_ - Variable in class jdsl.geomobj.ref.RatCircle2D
 
p2_ - Variable in class jdsl.geomobj.ref.IntCircle2D
 
p3_ - Variable in class jdsl.geomobj.ref.RatCircle2D
 
p3_ - Variable in class jdsl.geomobj.ref.IntCircle2D
 
PARENT - Static variable in class jdsl.graph.algo.DFS
Constant used as key to look up the parent of a vertex.
parent() - Method in class jdsl.core.ref.NodeBinaryTree.NBTNode
O(1) time
parent() - Method in class jdsl.core.ref.NodeBinaryTree.NBTSuperNode
Should never be called
parent(Position) - Method in interface jdsl.core.api.InspectableTree
Gets the parent of a given node.
parent(Position) - Method in class jdsl.core.ref.NodeBinaryTree
O(1) time
parent(Position) - Method in class jdsl.core.ref.NodeTree
O(1) time
parent(Vertex) - Method in class jdsl.graph.algo.DFS
Retrieves the parent Vertex of a Vertex
pathExists() - Method in class jdsl.graph.algo.IntegerDijkstraPathfinder
Returns whether a path between the source and the destination exists
perpendicular() - Method in interface jdsl.geomobj.api.Direction2D
 
perpendicular() - Method in class jdsl.geomobj.ref.RealDirection2D
 
perpendicular() - Method in class jdsl.geomobj.ref.RatDirection2D
 
perpendicular() - Method in class jdsl.geomobj.ref.IntDirection2D
 
perpendicularLine(LinearCurve2D, Point2D) - Method in interface jdsl.geomobj.api.GeomConstructor2D
 
perpendicularLine(LinearCurve2D, Point2D) - Method in class jdsl.geomobj.ref.GeomConstructor2DImpl
 
perpendicularRay(LinearCurve2D, Point2D) - Method in interface jdsl.geomobj.api.GeomConstructor2D
 
perpendicularRay(LinearCurve2D, Point2D) - Method in class jdsl.geomobj.ref.GeomConstructor2DImpl
 
PlanarityViolationException - exception jdsl.map.api.PlanarityViolationException.
 
PlanarityViolationException(String) - Constructor for class jdsl.map.api.PlanarityViolationException
 
Point2D - interface jdsl.geomobj.api.Point2D.
This interface describes a two-dimensional point.
Point2D.InfinitePoint2D - class jdsl.geomobj.api.Point2D.InfinitePoint2D.
A nested class, used to implement the constant INFINITE.
points() - Method in interface jdsl.geomobj.api.ClosedCurve2D
 
points() - Method in interface jdsl.geomobj.api.OpenCurve2D
 
points() - Method in class jdsl.geomobj.ref.AbstractRealLinearCurve2D
 
points() - Method in class jdsl.geomobj.ref.AbstractIntLinearCurve2D
 
points() - Method in class jdsl.geomobj.ref.AbstractRatLinearCurve2D
 
points() - Method in class jdsl.geomobj.ref.IntRectangle2D
 
points() - Method in class jdsl.geomobj.ref.RatCircle2D
 
points() - Method in class jdsl.geomobj.ref.RatRectangle2D
 
points() - Method in class jdsl.geomobj.ref.IntCircle2D
 
pos_to_element_s - Static variable in class jdsl.core.ref.ToString
 
posArray_ - Variable in class jdsl.core.ref.ArrayPositionIterator
 
posInsertAfter(Position, Position) - Method in class jdsl.core.ref.ArraySequence
Makes toInsert the predecessor of willBeSuccessor.
posInsertAfter(Position, Position) - Method in class jdsl.core.ref.NodeSequence
Make toInsert the successor of willBePredecessor
posInsertAtRank(int, Position) - Method in class jdsl.core.ref.ArraySequence
Makes toInsert to rankOfPos'th Position in this Sequence.
posInsertAtRank(int, Position) - Method in class jdsl.core.ref.NodeSequence
Make toInsert the rankOfPos'th position in this sequence
posInsertBefore(Position, Position) - Method in class jdsl.core.ref.ArraySequence
Makes toInsert the predecessor of willBeSuccessor.
posInsertBefore(Position, Position) - Method in class jdsl.core.ref.NodeSequence
Make toInsert the predecessor of willBeSuccessor
posInsertFirst(Position) - Method in class jdsl.core.ref.ArraySequence
Makes toInsert the first Position of this Sequence.
posInsertFirst(Position) - Method in class jdsl.core.ref.NodeSequence
Make toInsert the first position of this sequence
posInsertLast(Position) - Method in class jdsl.core.ref.ArraySequence
Makes toInsert the last Position of this Sequence.
posInsertLast(Position) - Method in class jdsl.core.ref.NodeSequence
Make toInsert the last position of this sequence
Position - interface jdsl.core.api.Position.
An abstraction of the notion of a "place" in a container -- where an element is stored relative to other elements in the container.
position() - Method in interface jdsl.core.api.PositionIterator
 
position() - Method in class jdsl.core.ref.ArrayPositionIterator
 
position() - Method in class jdsl.core.ref.InOrderIterator
Takes O(1) time
position() - Method in class jdsl.core.ref.PostOrderIterator
Takes O(1) time
position() - Method in class jdsl.core.ref.PreOrderIterator
Takes O(1) time
position() - Method in class jdsl.graph.ref.EdgeIteratorAdapter
 
position() - Method in class jdsl.graph.ref.VertexIteratorAdapter
 
position() - Method in class jdsl.map.ref.FaceIteratorAdapter
 
PositionalContainer - interface jdsl.core.api.PositionalContainer.
Positional containers (for example, sequences, trees, and graphs) are containers in which elements are related to each other through adjacency information.
PositionIterator - interface jdsl.core.api.PositionIterator.
Iterator over a set of positions.
positions() - Method in interface jdsl.core.api.InspectablePositionalContainer
Provides an iterator over all of the positions of the container.
positions() - Method in class jdsl.core.ref.NodeCircularSequence
O(1) if the structure does not change, O(N) otherwise.
positions() - Method in class jdsl.core.ref.ArraySequence
O(1) time if the cache already exitsts.
positions() - Method in class jdsl.core.ref.NodeBinaryTree
Takes O(N) time from the need to iterate through the tree during snapshot, where N is the number of positions in the tree
positions() - Method in class jdsl.core.ref.NodeSequence
O(1) time if the cache already exists Otherwise O(N) to construct it
positions() - Method in class jdsl.core.ref.NodeTree
O(1) time if cache already exists, O(size of the tree) otherwise
positions() - Method in class jdsl.graph.ref.AbstractGraph
Built on vertices() and edges().
positions() - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(n+m+l)
POSITIVE - Static variable in interface jdsl.geomobj.api.GeomTester2D
 
POSITIVE - Static variable in class jdsl.geomobj.ref.AbstractLinearCurve2D
 
PostOrderIterator - class jdsl.core.ref.PostOrderIterator.
The postorder iterator gives a postorder traversal of any tree.
PostOrderIterator(InspectableBinaryTree) - Constructor for class jdsl.core.ref.PostOrderIterator
Constructs a new PostOrderIterator to iterate over the given container Puts a reference to each position into the array -- takes O(N) time where N = the number of positions in the container
PostOrderIterator(InspectableTree) - Constructor for class jdsl.core.ref.PostOrderIterator
Constructs a new PostOrderIterator to iterate over the given container Puts a reference to each position into the array -- takes O(N) time where N = the number of positions in the container
pq_ - Variable in class jdsl.graph.algo.IntegerDijkstraTemplate
 
PreOrderIterator - class jdsl.core.ref.PreOrderIterator.
The preorder iterator gives a preorder iteration of the tree.
PreOrderIterator(InspectableBinaryTree) - Constructor for class jdsl.core.ref.PreOrderIterator
Constructs a new PreOrderIterator to iterate over the given binary tree Puts a reference to each position into the array -- takes O(N) time where N = the number of positions in the tree
PreOrderIterator(InspectableTree) - Constructor for class jdsl.core.ref.PreOrderIterator
Constructs a new PreOrderIterator to iterate over the given general tree Puts a reference to each position into the array -- takes O(N) time where N = the number of positions in the tree
prevIncidentEdge(Vertex, Edge) - Method in interface jdsl.map.api.InspectableOrderedGraph
 
prevIncidentEdge(Vertex, Edge) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
prevIncidentEdge(Vertex, Edge, int) - Method in interface jdsl.map.api.InspectableOrderedGraph
 
prevIncidentEdge(Vertex, Edge, int) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(degree)
PRIMAL_INDEX - Static variable in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
 
PriorityQueue - interface jdsl.core.api.PriorityQueue.
A partially-ordered container that allows for removal of the element with highest priority.
prospectiveCycle_ - Variable in class jdsl.graph.algo.DirectedFindCycleDFS
This stores a list of Vertices which are being checked to see if there is a cycle among them.
prospectiveCycle_ - Variable in class jdsl.graph.algo.FindCycleDFS
This stores a list of Vertices which are being checked to see if there is a cycle among them.

Q

Q - Variable in class jdsl.graph.algo.IntegerPrimTemplate
 
queue_ - Variable in class jdsl.graph.algo.AbstractTopologicalSort
Sequence used as a queue by the sort() method.

R

rankOf(Position) - Method in interface jdsl.core.api.InspectableSequence
Get the rank of a given position.
rankOf(Position) - Method in class jdsl.core.ref.ArraySequence
O(1) time.
rankOf(Position) - Method in class jdsl.core.ref.NodeSequence
O(1) time if the positions_ cache is valid (no modifications since cache was generated) O(N) if cache is invalid (must traverse rank elements of Sequence)
rankOfChild(Position) - Method in interface jdsl.core.api.InspectableTree
 
rankOfChild(Position) - Method in class jdsl.core.ref.NodeBinaryTree
O(1) time
rankOfChild(Position) - Method in class jdsl.core.ref.NodeTree
O(the number of children of the node) time
RatCircle2D - class jdsl.geomobj.ref.RatCircle2D.
A two-dimensional circle constructed using three integer or rational points.
RatCircle2D(Point2D, Point2D, Point2D) - Constructor for class jdsl.geomobj.ref.RatCircle2D
 
RatDirection2D - class jdsl.geomobj.ref.RatDirection2D.
A two-dimensional rational direction.
RatDirection2D(int, int) - Constructor for class jdsl.geomobj.ref.RatDirection2D
Constructor that uses two Cartesian coordinates of type int.
RatDirection2D(int, int, int) - Constructor for class jdsl.geomobj.ref.RatDirection2D
Constructor that uses three homogeneous coordinates of type int.
RatDirection2D(long, long) - Constructor for class jdsl.geomobj.ref.RatDirection2D
Constructor that uses two Cartesian coordinates of type long.
RatDirection2D(long, long, long) - Constructor for class jdsl.geomobj.ref.RatDirection2D
Constructor that uses three homogeneous coordinates of type long.
RatDirection2D(Number, Number) - Constructor for class jdsl.geomobj.ref.RatDirection2D
Constructor that uses two Cartesian coordinates of type Number.
RatDirection2D(Number, Number, Number) - Constructor for class jdsl.geomobj.ref.RatDirection2D
Constructor that uses three homogeneous coordinates of type Number.
RatIntGeomTests2D - class jdsl.geomobj.ref.RatIntGeomTests2D.
Default implementation of interface TwoArgsGeomTests2D with rational first argument and integer second argument.
RatIntGeomTests2D() - Constructor for class jdsl.geomobj.ref.RatIntGeomTests2D
 
RatIntIntGeomTests2D - class jdsl.geomobj.ref.RatIntIntGeomTests2D.
Implementation of interface ThreeArgsGeomTests2D with integer second and third arguments, and rational first argument.
RatIntIntGeomTests2D() - Constructor for class jdsl.geomobj.ref.RatIntIntGeomTests2D
 
RatIntRatGeomTests2D - class jdsl.geomobj.ref.RatIntRatGeomTests2D.
Implementation of interface ThreeArgsGeomTests2D with integer second argument, and rational first and third arguments.
RatIntRatGeomTests2D() - Constructor for class jdsl.geomobj.ref.RatIntRatGeomTests2D
 
RatLine2D - class jdsl.geomobj.ref.RatLine2D.
A Line2D constructed using either two distinct integer or rational points, or an integer or rational point and an integer or rational direction.
RatLine2D(Point2D, Direction2D) - Constructor for class jdsl.geomobj.ref.RatLine2D
Creates a line passing through point p with direction dir.
RatLine2D(Point2D, Point2D) - Constructor for class jdsl.geomobj.ref.RatLine2D
Creates a line passing through points p1 and p2; the underlying direction is from p1 to p2.
RatPoint2D - class jdsl.geomobj.ref.RatPoint2D.
A finite two dimensional geometric point with rational coordinates.
RatPoint2D(int, int) - Constructor for class jdsl.geomobj.ref.RatPoint2D
Constructor that uses two Cartesian coordinates of type int.
RatPoint2D(int, int, int) - Constructor for class jdsl.geomobj.ref.RatPoint2D
Constructor that uses three homogeneous coordinates of type int.
RatPoint2D(IntPoint2D) - Constructor for class jdsl.geomobj.ref.RatPoint2D
Constructor that uses an integer point.
RatPoint2D(long, long) - Constructor for class jdsl.geomobj.ref.RatPoint2D
Constructor that uses two Cartesian coordinates of type long.
RatPoint2D(long, long, long) - Constructor for class jdsl.geomobj.ref.RatPoint2D
Constructor that uses three homogeneous coordinates of type long.
RatPoint2D(Number, Number) - Constructor for class jdsl.geomobj.ref.RatPoint2D
Constructor that uses two Cartesian coordinates of type Number.
RatPoint2D(Number, Number, Number) - Constructor for class jdsl.geomobj.ref.RatPoint2D
Constructor that uses three homogeneous coordinates of type Number.
RatRatGeomTests2D - class jdsl.geomobj.ref.RatRatGeomTests2D.
Default implementation of interface TwoArgsGeomTests2D with rational arguments.
RatRatGeomTests2D() - Constructor for class jdsl.geomobj.ref.RatRatGeomTests2D
 
RatRatRatGeomTests2D - class jdsl.geomobj.ref.RatRatRatGeomTests2D.
Implementation of interface ThreeArgsGeomTests2D with rational arguments.
RatRatRatGeomTests2D() - Constructor for class jdsl.geomobj.ref.RatRatRatGeomTests2D
 
RatRay2D - class jdsl.geomobj.ref.RatRay2D.
RatRay2D is a Ray2D constructed using either two distinct integer or rational points, or an integer or rational point and an integer or rational direction.
RatRay2D(Point2D, Direction2D) - Constructor for class jdsl.geomobj.ref.RatRay2D
Creates a ray emanating from point source with direction dir.
RatRay2D(Point2D, Point2D) - Constructor for class jdsl.geomobj.ref.RatRay2D
Creates a ray emanating from point source and passing through point other; the underlying direction is from source to other.
RatRectangle2D - class jdsl.geomobj.ref.RatRectangle2D.
A two-dimensional rectangle constructed using two integer or rational points.
RatRectangle2D(Point2D, Point2D) - Constructor for class jdsl.geomobj.ref.RatRectangle2D
 
RatSegment2D - class jdsl.geomobj.ref.RatSegment2D.
A Segment2D constructed using two distinct integer or rational points.
RatSegment2D(Point2D, Point2D) - Constructor for class jdsl.geomobj.ref.RatSegment2D
Creates a segment with endpoints p1 and p2; the underlying direction is from p1 to p2.
Ray2D - interface jdsl.geomobj.api.Ray2D.
This interface describes a two-dimensional ray.
RealDirection2D - class jdsl.geomobj.ref.RealDirection2D.
This is the class for a two-dimensional real direction.
RealDirection2D(double, double) - Constructor for class jdsl.geomobj.ref.RealDirection2D
 
RealDirection2D(float, float) - Constructor for class jdsl.geomobj.ref.RealDirection2D
 
RealLine2D - class jdsl.geomobj.ref.RealLine2D.
RealLine2D is a Line2D constructed using either two real points or a real point and a real direction.
RealLine2D(Point2D, Direction2D) - Constructor for class jdsl.geomobj.ref.RealLine2D
Creates a line passing through point p with direction dir.
RealLine2D(Point2D, Point2D) - Constructor for class jdsl.geomobj.ref.RealLine2D
Creates a line passing through points p1 and p2; the underlying direction is from p1 to p2.
RealPoint2D - class jdsl.geomobj.ref.RealPoint2D.
This is the class for a two-dimensional geometric point with real coordinates.
RealPoint2D(double, double) - Constructor for class jdsl.geomobj.ref.RealPoint2D
 
RealPoint2D(float, float) - Constructor for class jdsl.geomobj.ref.RealPoint2D
 
RealRay2D - class jdsl.geomobj.ref.RealRay2D.
RealRay2D is a Ray2D constructed using either two distinct real points or a real point and a real direction.
RealRay2D(Point2D, Direction2D) - Constructor for class jdsl.geomobj.ref.RealRay2D
Creates a ray emanating from point source with direction dir.
RealRay2D(Point2D, Point2D) - Constructor for class jdsl.geomobj.ref.RealRay2D
Creates a ray emanating from point source and passing through point other; the underlying direction is from source to other.
RealSegment2D - class jdsl.geomobj.ref.RealSegment2D.
RealSegment2D is a Segment2D constructed using two distinct real points.
RealSegment2D(Point2D, Point2D) - Constructor for class jdsl.geomobj.ref.RealSegment2D
Creates a segment passing with endpoints p1 and p2; the underlying direction is from p1 to p2.
recolorAfterRemove(Position) - Method in class jdsl.core.ref.RedBlackTree
Takes O(logN) time -- where N = the number of locators in the tree * and O(logN) = the height of the tree Recolors after removal....i.e.
Rectangle2D - interface jdsl.geomobj.api.Rectangle2D.
This interface describes a two-dimensional rectangle with sides parallel to the x-axis and y-axis.
RED - Static variable in class jdsl.core.ref.RedBlackTree
 
RedBlackTree - class jdsl.core.ref.RedBlackTree.
A Dictionary implemented as a red-black tree.
RedBlackTree(Comparator) - Constructor for class jdsl.core.ref.RedBlackTree
Takes O(1) time This constructor creates the tree with a single no-element-stored-here locator.
rehash() - Method in class jdsl.core.ref.HashtableDecorable
 
relaxingEdge(Vertex, Edge, int, Vertex, int) - Method in class jdsl.graph.algo.IntegerPrimTemplate
Can be overridden in any application where the edges considered for the minimum spanning tree matter.
remove(Locator) - Method in interface jdsl.core.api.KeyBasedContainer
Removes a (key,element) pair from the container.
remove(Locator) - Method in class jdsl.core.ref.ArraySkipList
Runs in expected O(log n) time, where n is the number of elements.
remove(Locator) - Method in class jdsl.core.ref.RedBlackTree
Takes O(logN) time -- where N = the number of locators in the tree and O(logN) = the height of the tree The worst-case removal would restructure once each step up the tree.
remove(Locator) - Method in class jdsl.core.ref.HashtableDictionary
O(1) expected: strictly O(1) unless removal reduces size below the downhashing threshhold, in which case it is O(N)
remove(Locator) - Method in class jdsl.core.ref.ArrayHeap
If array-shrinking is specified at construction time and the load factor of the array is 0.25 after the removal, the capacity of the array is halved by copying the elements into a new array.
remove(Position) - Method in interface jdsl.core.api.CircularSequence
Remove and invalidate the position specified
remove(Position) - Method in interface jdsl.core.api.Sequence
Removes and invalidates the specified position
remove(Position) - Method in class jdsl.core.ref.NodeCircularSequence
O(1)
remove(Position) - Method in class jdsl.core.ref.ArraySequence
This method also clears the Position and element caches.
remove(Position) - Method in class jdsl.core.ref.NodeSequence
This method also clears the position cache.
removeAboveExternal(Position) - Method in interface jdsl.core.api.BinaryTree
The parent of node is deleted, and the sibling of node, with all its children, is installed in its place; node is also deleted.
removeAboveExternal(Position) - Method in class jdsl.core.ref.NodeBinaryTree
O(1) time
removeAfter(Position) - Method in interface jdsl.core.api.CircularSequence
Remove and invalidate the position after the position specified
removeAfter(Position) - Method in interface jdsl.core.api.Sequence
Remove and invalidates the position after the position specified
removeAfter(Position) - Method in class jdsl.core.ref.AbstractCircularSequence
 
removeAfter(Position) - Method in class jdsl.core.ref.ArraySequence
This method also clears the Position and element caches.
removeAfter(Position) - Method in class jdsl.core.ref.NodeSequence
This method also clears the position cache.
removeAll(Object) - Method in interface jdsl.core.api.Dictionary
Removes all the (key,element) pairs matching the parameter key.
removeAll(Object) - Method in class jdsl.core.ref.ArraySkipList
Runs in expected O(log n + k) where k is the number of duplicate keys and n is the number of elements.
removeAll(Object) - Method in class jdsl.core.ref.RedBlackTree
Takes O(RlogN) time where R = the number of objects with key key and log N = the height of the tree (N locators in the tree) (one removal case per each object)
removeAll(Object) - Method in class jdsl.core.ref.HashtableDictionary
O(#elts with target key) expected, worst case O(N) with excessive chaining, or if removeAll drops the size below the downhashing threshhold.
removeAtRank(int) - Method in interface jdsl.core.api.Sequence
Removes and invalidates the position at the specified rank
removeAtRank(int) - Method in class jdsl.core.ref.ArraySequence
This method also clears the Position and element caches.
removeAtRank(int) - Method in class jdsl.core.ref.NodeSequence
This method also clears the position cache.
removeBefore(Position) - Method in interface jdsl.core.api.CircularSequence
Remove the position before the position specified
removeBefore(Position) - Method in interface jdsl.core.api.Sequence
Removes and invalidates the position before the position specified.
removeBefore(Position) - Method in class jdsl.core.ref.AbstractCircularSequence
 
removeBefore(Position) - Method in class jdsl.core.ref.ArraySequence
This method also clears the Position and element caches.
removeBefore(Position) - Method in class jdsl.core.ref.NodeSequence
This method also clears the position cache.
removeEdge(Edge) - Method in interface jdsl.graph.api.Graph
 
removeEdge(Edge) - Method in class jdsl.graph.ref.IncidenceListGraph
O(1)
removeEdge(Edge) - Method in interface jdsl.map.api.EmbeddedPlanarGraph
Removes an edge.
removeEdge(Edge) - Method in interface jdsl.map.api.OrderedGraph
 
removeEdge(Edge) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
removeEdge(Edge) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
removeExternal(Position) - Method in interface jdsl.core.api.Tree
Removes an external node (a leaf).
removeExternal(Position) - Method in class jdsl.core.ref.NodeTree
O(1) time
removeFirst() - Method in interface jdsl.core.api.Sequence
Removes and invalidates the first position of this.
removeFirst() - Method in class jdsl.core.ref.ArraySequence
This method also clears the Position and element caches.
removeFirst() - Method in class jdsl.core.ref.NodeSequence
This method also clears the position cache.
removeKey(Object) - Method in class jdsl.core.ref.ArraySkipList
Runs in expected O(log n) time, where n is the number of elements.
removeKey(Object) - Method in class jdsl.core.ref.RedBlackTree
Takes O(logN) time -- where N = the number of locators in the tree and O(logN) = the height of the tree The worst-case removal would restructure once each step up the tree.
removeKey(Object) - Method in class jdsl.core.ref.HashtableDictionary
Removes the first element found with the given key from the hashtable.
removeLast() - Method in interface jdsl.core.api.Sequence
Removes and invalidates the last position of this.
removeLast() - Method in class jdsl.core.ref.ArraySequence
This method also clears the Position and element caches.
removeLast() - Method in class jdsl.core.ref.NodeSequence
This method also clears the position cache.
removeMin() - Method in interface jdsl.core.api.PriorityQueue
Pops the highest-priority element off the priority queue and updates the priority queue.
removeMin() - Method in class jdsl.core.ref.ArrayHeap
If array-shrinking is specified at construction time and the load factor of the array is 0.25 after the removal, the capacity of the array is halved by copying the elements into a new array.
removeSelfAndAbove() - Method in class jdsl.core.ref.NodeBinaryTree.NBTNode
O(1) time This method removes this node and its parent, replacing its parent with my sibling This is the asymmetric opposite of expand.
removeSelfAndAbove() - Method in class jdsl.core.ref.NodeBinaryTree.NBTSuperNode
Should never be called
removeVertex(Vertex) - Method in interface jdsl.graph.api.Graph
Removes a vertex and all its incident edges.
removeVertex(Vertex) - Method in class jdsl.graph.ref.IncidenceListGraph
O(degree)
removeVertex(Vertex) - Method in interface jdsl.map.api.EmbeddedPlanarGraph
Removes a vertex and all its incident edges.
removeVertex(Vertex) - Method in interface jdsl.map.api.OrderedGraph
Removes a vertex and all its incident edges.
removeVertex(Vertex) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(degree(v))
removeVertex(Vertex) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(degree)
replaceElement(Accessor, Object) - Method in interface jdsl.core.api.Container
Changes the element stored at an accessor.
replaceElement(Accessor, Object) - Method in class jdsl.core.ref.ArraySkipList
Runs in O(1) time.
replaceElement(Accessor, Object) - Method in class jdsl.core.ref.RedBlackTree
Takes O(1) time
replaceElement(Accessor, Object) - Method in class jdsl.core.ref.NodeCircularSequence
O(1)
replaceElement(Accessor, Object) - Method in class jdsl.core.ref.HashtableDictionary
O(1)
replaceElement(Accessor, Object) - Method in class jdsl.core.ref.ArrayHeap
time complexity = worst-case O(1)
replaceElement(Accessor, Object) - Method in class jdsl.core.ref.ArraySequence
This method also invalidates the elements cache.
replaceElement(Accessor, Object) - Method in class jdsl.core.ref.NodeBinaryTree
O(1) time
replaceElement(Accessor, Object) - Method in class jdsl.core.ref.NodeSequence
O(1) time
replaceElement(Accessor, Object) - Method in class jdsl.core.ref.NodeTree
O(1) time
replaceElement(Accessor, Object) - Method in class jdsl.graph.ref.InspectableSubgraph
This method is unsupported.
replaceElement(Accessor, Object) - Method in class jdsl.graph.ref.IncidenceListGraph
O(1)
replaceElement(Accessor, Object) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
replaceElement(Accessor, Object) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
replaceElement(Object) - Method in class jdsl.core.ref.NodeBinaryTree.NBTNode
O(1) time Replaces my element, returning the old element
replaceElement(Object) - Method in class jdsl.core.ref.NodeBinaryTree.NBTSuperNode
Should never be called
replaceKey(Locator, Object) - Method in interface jdsl.core.api.KeyBasedContainer
Replaces the key in the given (key,element) pair, adjusting the container as necessary.
replaceKey(Locator, Object) - Method in class jdsl.core.ref.ArraySkipList
Runs in expected O(log n) time, where n is the number of elements.
replaceKey(Locator, Object) - Method in class jdsl.core.ref.RedBlackTree
Takes O(logN) time -- where N = the number of locators in the tree and O(logN) = the height of the tree Takes the running time it would take to execute both remove and insert.
replaceKey(Locator, Object) - Method in class jdsl.core.ref.HashtableDictionary
O(1)
replaceKey(Locator, Object) - Method in class jdsl.core.ref.ArrayHeap
time complexity = worst-case O(log n)
replaceSelf(NodeBinaryTree.NBTNode) - Method in class jdsl.core.ref.NodeBinaryTree.NBTNode
O(1) time Replaces me with a new node, as far as my parent is concerned protected so restructurable trees can use it
replaceSelf(NodeBinaryTree.NBTNode) - Method in class jdsl.core.ref.NodeBinaryTree.NBTSuperNode
Should never be called
replaceSubtree(Position, BinaryTree) - Method in interface jdsl.core.api.BinaryTree
Swaps a subtree of this binary tree with a binary tree passed in.
replaceSubtree(Position, BinaryTree) - Method in class jdsl.core.ref.NodeBinaryTree
Takes O(S1+S2) time, where S1 and S2 are the number of positions in each subtree You are only allowed to link in and replaceSubtree with other instances of NodeBinaryTree (or subclasses thereof)
replaceSubtree(Position, Tree) - Method in interface jdsl.core.api.Tree
Replaces the subtree rooted at node with the tree t.
replaceSubtree(Position, Tree) - Method in class jdsl.core.ref.NodeTree
O(size of the new subtree + size of the cut tree) time
reportPath() - Method in class jdsl.graph.algo.IntegerDijkstraPathfinder
 
reset() - Method in interface jdsl.core.api.ObjectIterator
Puts the iterator back in its initial, before-the-first state
reset() - Method in class jdsl.core.ref.AbstractArrayIterator
Takes O(1) time
reset() - Method in class jdsl.core.ref.ArrayObjectIterator
Takes O(1) time
reset() - Method in class jdsl.core.ref.InOrderIterator
Takes O(1) time Sets the current node to the first node.
reset() - Method in class jdsl.core.ref.PostOrderIterator
Takes O(1) time Sets the current node to the first node.
reset() - Method in class jdsl.core.ref.PreOrderIterator
Takes O(1) time Sets the current node to the first node.
reset() - Method in class jdsl.graph.ref.EdgeIteratorAdapter
 
reset() - Method in class jdsl.graph.ref.VertexIteratorAdapter
 
reset() - Method in class jdsl.graph.ref.AbstractGraph.OO_to_O_MergerIterator
 
reset() - Method in class jdsl.map.ref.FaceIteratorAdapter
 
resetToEmpty() - Method in class jdsl.core.ref.NodeBinaryTree
Used for resetting the tree to an empty tree after a link or replaceSubtree operation.
result() - Method in class jdsl.graph.algo.BFS
Abstract method called at the very end of the BFS execution.
reverseDirection(Edge) - Method in interface jdsl.graph.api.ModifiableGraph
Reverse the direction of an edge.
reverseDirection(Edge) - Method in class jdsl.graph.ref.IncidenceListGraph
O(1)
reverseDirection(Edge) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
reverseDirection(Edge) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
RIGHT - Static variable in interface jdsl.geomobj.api.GeomTester2D
 
right_ - Variable in class jdsl.geomobj.ref.AbstractLinearCurve2D
 
RIGHT_TURN - Static variable in interface jdsl.geomobj.api.GeomTester2D
 
right() - Method in class jdsl.core.ref.NodeBinaryTree.NBTNode
O(1) time
right() - Method in class jdsl.core.ref.NodeBinaryTree.NBTSuperNode
Should never be called
rightChild(Position) - Method in interface jdsl.core.api.InspectableBinaryTree
Provides the right child of a given node.
rightChild(Position) - Method in class jdsl.core.ref.NodeBinaryTree
O(1) time
rightFace(Edge) - Method in interface jdsl.map.api.InspectableEmbeddedPlanarGraph
 
rightFace(Edge) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
rightPoint() - Method in interface jdsl.geomobj.api.Segment2D
 
rightPoint() - Method in class jdsl.geomobj.ref.IntSegment2D
 
rightPoint() - Method in class jdsl.geomobj.ref.RealSegment2D
 
rightPoint() - Method in class jdsl.geomobj.ref.RatSegment2D
 
root() - Method in interface jdsl.core.api.InspectableTree
Gets the root of this tree.
root() - Method in class jdsl.core.ref.NodeBinaryTree
O(1) time
root() - Method in class jdsl.core.ref.NodeTree
O(1) time
runUntil() - Method in class jdsl.graph.algo.IntegerDijkstraTemplate
Repeatedly calls method doOneIteration() until either the priority queue is empty or method shouldContinue() returns false.

S

Segment2D - interface jdsl.geomobj.api.Segment2D.
This interface describes a two-dimensional segment.
Sequence - interface jdsl.core.api.Sequence.
A positional container whose elements are linearly organized.
sequenceToList(InspectableSequence, List) - Static method in class jdsl.core.util.Converter
Places the contents of a sequence into a list, preserving order
sequenceToSet(InspectableSequence, Set) - Static method in class jdsl.core.util.Converter
Places the contents of a sequence into a set
SerializableObject - class jdsl.core.ref.SerializableObject.
An object which can be used as a key for decorations, but which is Serializable.
SerializableObject() - Constructor for class jdsl.core.ref.SerializableObject
 
set(Object, Object) - Method in interface jdsl.core.api.Decorable
Sets the value in the (attribute, value) entry associated with a certain attribute in this decorable object.
set(Object, Object) - Method in class jdsl.core.ref.HashtableDecorable
Sets the value of a decoration.
set(Object, Object) - Method in class jdsl.graph.api.Edge.NONEEdge
 
set(Object, Object) - Method in class jdsl.graph.api.Vertex.NONEVertex
 
set(Object, Object) - Method in class jdsl.map.api.Face.NONEFace
 
setArrayShrinkability(boolean) - Method in class jdsl.core.ref.ArraySequence
A public convenience method that allows the user to toggle the shrinkability of the array.
setChild(NodeBinaryTree.NBTNode, NodeBinaryTree.NBTNode) - Method in class jdsl.core.ref.NodeBinaryTree.NBTNode
O(1) time Replaces one of my children with a new node protected to allow SuperNode to override it
setChild(NodeBinaryTree.NBTNode, NodeBinaryTree.NBTNode) - Method in class jdsl.core.ref.NodeBinaryTree.NBTSuperNode
O(1) time Sets this node's root; any other use of this method is invalid
setContainer(NodeBinaryTree) - Method in class jdsl.core.ref.NodeBinaryTree.NBTNode
O(1) time Sets the parameter container as this node's container
setDirectionFrom(Edge, Vertex) - Method in interface jdsl.graph.api.ModifiableGraph
Sets the direction of an edge away from a vertex.
setDirectionFrom(Edge, Vertex) - Method in class jdsl.graph.ref.IncidenceListGraph
O(1)
setDirectionFrom(Edge, Vertex) - Method in interface jdsl.map.api.EmbeddedPlanarGraph
Sets the direction of an edge away from a vertex.
setDirectionFrom(Edge, Vertex) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
setDirectionFrom(Edge, Vertex) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
setDirectionTo(Edge, Vertex) - Method in interface jdsl.graph.api.ModifiableGraph
Sets the direction of an edge towards a vertex.
setDirectionTo(Edge, Vertex) - Method in class jdsl.graph.ref.IncidenceListGraph
O(1)
setDirectionTo(Edge, Vertex) - Method in interface jdsl.map.api.EmbeddedPlanarGraph
Sets the direction of an edge towards a vertex.
setDirectionTo(Edge, Vertex) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
setDirectionTo(Edge, Vertex) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
setEdgeToParent(Vertex, Edge) - Method in class jdsl.graph.algo.IntegerDijkstraTemplate
Can be overridden to supply a way of storing and retrieving one edge per vertex.
setElement(Object) - Method in class jdsl.core.ref.NodeSequence.FNSNode
Sets the position's element
setLeft() - Method in class jdsl.core.ref.NodeBinaryTree.NBTSuperNode
Should never be called
setLeft(NodeBinaryTree.NBTNode) - Method in class jdsl.core.ref.NodeBinaryTree.NBTNode
O(1) time Sets the parameter node as this node's left child
setLeftFace(Edge, Face) - Method in interface jdsl.map.api.EmbeddedPlanarGraph
Sets the direction of an edge so that a face is its left face.
setLeftFace(Edge, Face) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
setLocator(Vertex, Locator) - Method in class jdsl.graph.algo.IntegerPrimTemplate
Can be overridden to supply a way of storing and retrieving one locator per vertex.
setLocator(Vertex, Locator) - Method in class jdsl.graph.algo.IntegerDijkstraTemplate
Can be overridden to supply a way of storing and retrieving one locator per vertex.
setParent() - Method in class jdsl.core.ref.NodeBinaryTree.NBTSuperNode
Should never be called
setParent(NodeBinaryTree.NBTNode) - Method in class jdsl.core.ref.NodeBinaryTree.NBTNode
O(1) time Sets the parameter node as this node's parent
setRight() - Method in class jdsl.core.ref.NodeBinaryTree.NBTSuperNode
Should never be called
setRight(NodeBinaryTree.NBTNode) - Method in class jdsl.core.ref.NodeBinaryTree.NBTNode
O(1) time Sets the parameter node as this node's right child
setRightFace(Edge, Face) - Method in interface jdsl.map.api.EmbeddedPlanarGraph
Sets the direction of an edge so that a face is its right face.
setRightFace(Edge, Face) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
setRoot(NodeBinaryTree.NBTNode) - Method in class jdsl.core.ref.NodeBinaryTree.NBTSuperNode
O(1) time Sets this node's root
setStartingPosition(Position) - Method in interface jdsl.core.api.CircularSequence
Sets the position that will be returned by method startingPosition() of InspectableCircularSequence
setStartingPosition(Position) - Method in class jdsl.core.ref.NodeCircularSequence
O(1)
setTolerance(double) - Method in class jdsl.geomobj.ref.RealPoint2D
Sets the tolerance with which two real points are considered equal
setToSequence(Set, Sequence) - Static method in class jdsl.core.util.Converter
Places the contents of a set into a sequence
shortestPathFound(Vertex, int) - Method in class jdsl.graph.algo.IntegerDijkstraTemplate
Can be overridden to give you a notification when the shortest path to a vertex is determined.
shouldContinue() - Method in class jdsl.graph.algo.IntegerPrimTemplate
Can be overridden in any application where the full minimum spanning tree is not needed and the algorithm should terminate early.
shouldContinue() - Method in class jdsl.graph.algo.IntegerDijkstraTemplate
Can be overridden in any application where the full shortest-path tree is not needed and the algorithm should terminate early.
shouldContinue() - Method in class jdsl.graph.algo.IntegerDijkstraPathfinder
 
sibling(Position) - Method in interface jdsl.core.api.InspectableBinaryTree
Provides the sibling of a given node (the other child of the node's parent)
sibling(Position) - Method in class jdsl.core.ref.NodeBinaryTree
O(1) time
siblingAfter(Position) - Method in interface jdsl.core.api.InspectableTree
 
siblingAfter(Position) - Method in class jdsl.core.ref.NodeBinaryTree
O(1) time
siblingAfter(Position) - Method in class jdsl.core.ref.NodeTree
O(1) time
siblingBefore(Position) - Method in interface jdsl.core.api.InspectableTree
 
siblingBefore(Position) - Method in class jdsl.core.ref.NodeBinaryTree
O(1) time
siblingBefore(Position) - Method in class jdsl.core.ref.NodeTree
O(the number of children of the node) time
siblings(Position) - Method in interface jdsl.core.api.InspectableTree
Returns an iterator over the siblings of the node in order.
siblings(Position) - Method in class jdsl.core.ref.NodeBinaryTree
O(1) time
siblings(Position) - Method in class jdsl.core.ref.NodeTree
O(the number of children of the node) time
SINGLE - Static variable in interface jdsl.geomobj.api.GeomTester2D
 
size() - Method in interface jdsl.core.api.InspectableContainer
Gives the number of elements stored in the container.
size() - Method in class jdsl.core.ref.ArraySkipList
Runs in O(1) time.
size() - Method in class jdsl.core.ref.RedBlackTree
Takes O(1) time
size() - Method in class jdsl.core.ref.NodeCircularSequence
O(1)
size() - Method in class jdsl.core.ref.HashtableDictionary
O(1)
size() - Method in class jdsl.core.ref.ArrayHeap
time complexity = worst-case O(1)
size() - Method in class jdsl.core.ref.HashtableDecorable
Gets the size.
size() - Method in class jdsl.core.ref.ArraySequence
O(1) time.
size() - Method in class jdsl.core.ref.NodeBinaryTree
O(1) time
size() - Method in class jdsl.core.ref.NodeSequence
O(1) time
size() - Method in class jdsl.core.ref.NodeTree
O(1) time
size() - Method in class jdsl.graph.ref.AbstractGraph
Built on numVertices() and numEdges().
size() - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
slope_ - Variable in class jdsl.geomobj.ref.AbstractLinearCurve2D
 
sort() - Method in class jdsl.graph.algo.AbstractTopologicalSort
This abstract method is overridden in the subclasses.
sort() - Method in class jdsl.graph.algo.TopologicalSort
The meat of the algorithm.
sort() - Method in class jdsl.graph.algo.UnitWeightedTopologicalNumbering
The meat of the algorithm.
sort(Sequence, Comparator) - Method in class jdsl.core.algo.sorts.ArrayQuickSort
 
sort(Sequence, Comparator) - Method in class jdsl.core.algo.sorts.ListMergeSort
Recursively divides a Sequence into (roughly) equal subsequences and merges them back together once sorted.
sort(Sequence, Comparator) - Method in interface jdsl.core.algo.sorts.SortObject
Method that actually sorts the sequence, with the first element after the sort being the one that the comparator reported was smallest.
sort(Sequence, Comparator) - Method in class jdsl.core.algo.sorts.ArrayMergeSort
 
sort(Sequence, Comparator) - Method in class jdsl.core.algo.sorts.ListQuickSort
Partition the sequence, and recursively sort the two subsequences on either side of the partition element.
sort(Sequence, Comparator) - Method in class jdsl.core.algo.sorts.HeapSort
 
sortedmapToOrderedDictionary(SortedMap, OrderedDictionary) - Static method in class jdsl.core.util.Converter
Places the contents of a sorted map into an ordered dictionary
sortedVertices() - Method in class jdsl.graph.algo.TopologicalSort
Returns a VertexIterator containing all the Vertices in topologically sorted order.
SortObject - interface jdsl.core.algo.sorts.SortObject.
Algorithm interface for sorting a sequence according to a given comparator of elements.
source - Variable in class jdsl.graph.algo.IntegerPrimTemplate
 
source_ - Variable in class jdsl.graph.algo.IntegerDijkstraTemplate
 
source() - Method in interface jdsl.geomobj.api.Ray2D
 
source() - Method in class jdsl.geomobj.ref.IntRay2D
 
source() - Method in class jdsl.geomobj.ref.RatRay2D
 
source() - Method in class jdsl.geomobj.ref.RealRay2D
 
splice(Position, CircularSequence, Position) - Method in interface jdsl.core.api.CircularSequence
Merges in another CircularSequence (leaving it empty) after a given position.
splice(Position, CircularSequence, Position) - Method in class jdsl.core.ref.NodeCircularSequence
O(N)
split(Position, Position) - Method in interface jdsl.core.api.CircularSequence
Snips out a chain of nodes from this CircularSequence, repairs this CircularSequence, and makes a new CircularSequence with the snipped-out nodes.
split(Position, Position) - Method in class jdsl.core.ref.NodeCircularSequence
O(N)
splitEdge(Edge, Object) - Method in interface jdsl.graph.api.ModifiableGraph
Splits an existing edge by inserting a new vertex and two new edges, and removing the old edge.
splitEdge(Edge, Object) - Method in class jdsl.graph.ref.IncidenceListGraph
O(1)
splitEdge(Edge, Object) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
splitEdge(Edge, Object) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
splitVertex(Vertex, Edge, Edge, Object) - Method in interface jdsl.map.api.OrderedGraph
Splits an existing vertex into two new vertices connected by a new edge.
splitVertex(Vertex, Edge, Edge, Object) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(degree)
splitVertex(Vertex, Edge, Face, Edge, Face, Object) - Method in interface jdsl.map.api.EmbeddedPlanarGraph
Splits an existing vertex into two new vertices connected by a new edge.
splitVertex(Vertex, Edge, Face, Edge, Face, Object) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
 
sqRadius_ - Variable in class jdsl.geomobj.ref.AbstractCircle2D
 
sqRadius_computed_ - Variable in class jdsl.geomobj.ref.AbstractCircle2D
 
sqRadius_denom_ - Variable in class jdsl.geomobj.ref.AbstractCircle2D
 
sqRadius_num_ - Variable in class jdsl.geomobj.ref.AbstractCircle2D
 
squaredRadius() - Method in interface jdsl.geomobj.api.Circle2D
This approximate method is provided for visualization purposes only; computations should be performed through methods of GeomTester2D.
squaredRadius() - Method in class jdsl.geomobj.ref.AbstractCircle2D
 
START_TIME - Static variable in class jdsl.graph.algo.DFS
Constant used as key to look up the start time of a vertex.
startingPosition() - Method in interface jdsl.core.api.InspectableCircularSequence
Gives a position from the circular sequence without any guarantee about what position is returned.
startingPosition() - Method in class jdsl.core.ref.NodeCircularSequence
O(1)
startTime(Vertex) - Method in class jdsl.graph.algo.DFS
Returns the "Start time" of a Vertex.
startVisit(Vertex) - Method in class jdsl.graph.algo.DFS
Called when a vertex is visited.
startVisit(Vertex) - Method in class jdsl.graph.algo.BFS
Abstract method called on a vertex when it is visited.
startVisit(Vertex) - Method in class jdsl.graph.algo.DirectedFindCycleDFS
As new vertices are visited, they are added to the prospective cyclic path.
startVisit(Vertex) - Method in class jdsl.graph.algo.FindCycleDFS
As new vertices are visited, they are added to the prospective cyclic path.
status(Vertex) - Method in class jdsl.graph.algo.DFS
Accesses the current status of the given Vertex.
stringfor(Edge) - Static method in class jdsl.graph.ref.ToString
 
stringfor(Edge, InspectableGraph) - Method in interface jdsl.graph.ref.ToString.EdgeToString
 
stringfor(Edge, InspectableGraph) - Method in class jdsl.graph.ref.ToString.EdgeInRTStyle
 
stringfor(Edge, InspectableGraph) - Method in class jdsl.graph.ref.ToString.EdgeToEmptyString
 
stringfor(InspectableGraph) - Static method in class jdsl.graph.ref.ToString
 
stringfor(InspectableGraph, ToString.VertexToString, ToString.EdgeToString) - Static method in class jdsl.graph.ref.ToString
Code lifted shamelessly from rt's corresponding class in jdsltools.testers.graph, then adapted to the style of my jdsl.core.ref.ToString.
stringfor(InspectableKeyBasedContainer) - Static method in class jdsl.core.ref.ToString
Default version of stringfor( InspKBC, LTS ).
stringfor(InspectableKeyBasedContainer, ToString.LocatorToString) - Static method in class jdsl.core.ref.ToString
Gives string representation of a dictionary or priority queue, parameterized by how to represent each locator (i.e., constructs a string by iterating over all locators of the container, concatenating the specified string representation of each locator).
stringfor(InspectableSequence) - Static method in class jdsl.core.ref.ToString
Default version of stringfor( InspSeq, PTS ).
stringfor(InspectableSequence, ToString.PositionToString) - Static method in class jdsl.core.ref.ToString
Gives string representation of a sequence, parameterized by how to represent each position (i.e., constructs a string by iterating over all positions of the sequence, concatenating the specified string representation of each position).
stringfor(InspectableTree) - Static method in class jdsl.core.ref.ToString
Default version of stringfor( InspTree, PTS ).
stringfor(InspectableTree, ToString.PositionToString) - Static method in class jdsl.core.ref.ToString
Gives string representation of a tree, parametrized by how to represent each position.
stringfor(Locator) - Static method in class jdsl.core.ref.ToString
 
stringfor(Locator) - Method in interface jdsl.core.ref.ToString.LocatorToString
 
stringfor(Locator) - Method in class jdsl.core.ref.ToString.LocatorCollectionsStyle
 
stringfor(Position) - Static method in class jdsl.core.ref.ToString
 
stringfor(Position) - Method in interface jdsl.core.ref.ToString.PositionToString
 
stringfor(Position) - Method in class jdsl.core.ref.ToString.PositionWritesElementOnly
 
stringfor(Vertex) - Static method in class jdsl.graph.ref.ToString
 
stringfor(Vertex) - Method in interface jdsl.graph.ref.ToString.VertexToString
 
stringfor(Vertex) - Method in class jdsl.graph.ref.ToString.VertexWritesElementOnly
 
stringfor(Vertex) - Method in class jdsl.graph.ref.ToString.VertexToEmptyString
 
supportingLine() - Method in interface jdsl.geomobj.api.Ray2D
 
supportingLine() - Method in interface jdsl.geomobj.api.Segment2D
 
supportingLine() - Method in class jdsl.geomobj.ref.IntSegment2D
 
supportingLine() - Method in class jdsl.geomobj.ref.RealSegment2D
 
supportingLine() - Method in class jdsl.geomobj.ref.IntRay2D
 
supportingLine() - Method in class jdsl.geomobj.ref.RatSegment2D
 
supportingLine() - Method in class jdsl.geomobj.ref.RatRay2D
 
supportingLine() - Method in class jdsl.geomobj.ref.RealRay2D
 
swapElements(Position, Position) - Method in interface jdsl.core.api.PositionalContainer
Swaps the elements associated with the two positions, leaving the positions themselves "where" they were.
swapElements(Position, Position) - Method in class jdsl.core.ref.AbstractPositionalContainer
Works on top of PositionalContainer method replaceElement(Position, Object) and InspectableContainer method contains().
swapElements(Position, Position) - Method in class jdsl.core.ref.NodeTree
O(1) time
swapWithNode(NodeBinaryTree.NBTNode) - Method in class jdsl.core.ref.NodeBinaryTree.NBTSuperNode
Should never be called

T

thisIndex_ - Variable in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
 
ThreeArgsGeomTests2D - interface jdsl.geomobj.api.ThreeArgsGeomTests2D.
A collection of geometric tests taking three arguments.
ToByteArray - interface jdsl.core.ref.ToByteArray.
Converts an object to a byte array
top_ - Variable in class jdsl.geomobj.ref.AbstractLinearCurve2D
 
topLeft_ - Variable in class jdsl.geomobj.ref.IntRectangle2D
 
topLeft_ - Variable in class jdsl.geomobj.ref.RatRectangle2D
 
topLeftPoint() - Method in interface jdsl.geomobj.api.Rectangle2D
 
topLeftPoint() - Method in class jdsl.geomobj.ref.IntRectangle2D
 
topLeftPoint() - Method in class jdsl.geomobj.ref.RatRectangle2D
 
TopologicalSort - class jdsl.graph.algo.TopologicalSort.
This algorithm class performs a topological ordering on a given DAG.
TopologicalSort() - Constructor for class jdsl.graph.algo.TopologicalSort
Constructor
topPoint() - Method in interface jdsl.geomobj.api.Segment2D
 
topPoint() - Method in class jdsl.geomobj.ref.IntSegment2D
 
topPoint() - Method in class jdsl.geomobj.ref.RealSegment2D
 
topPoint() - Method in class jdsl.geomobj.ref.RatSegment2D
 
topRight_ - Variable in class jdsl.geomobj.ref.IntRectangle2D
 
topRight_ - Variable in class jdsl.geomobj.ref.RatRectangle2D
 
topRightPoint() - Method in interface jdsl.geomobj.api.Rectangle2D
 
topRightPoint() - Method in class jdsl.geomobj.ref.IntRectangle2D
 
topRightPoint() - Method in class jdsl.geomobj.ref.RatRectangle2D
 
ToString - class jdsl.core.ref.ToString.
Collection of static methods that generate a string representing a container or accessor.
ToString - class jdsl.graph.ref.ToString.
Class with static methods to generate a string representing a graph.
ToString.EdgeInRTStyle - class jdsl.graph.ref.ToString.EdgeInRTStyle.
 
ToString.EdgeToEmptyString - class jdsl.graph.ref.ToString.EdgeToEmptyString.
 
ToString.EdgeToEmptyString() - Constructor for class jdsl.graph.ref.ToString.EdgeToEmptyString
 
ToString.EdgeToString - interface jdsl.graph.ref.ToString.EdgeToString.
 
ToString.LocatorCollectionsStyle - class jdsl.core.ref.ToString.LocatorCollectionsStyle.
Stringifies a locator in the Java Collections style: (key)=(element).
ToString.LocatorCollectionsStyle() - Constructor for class jdsl.core.ref.ToString.LocatorCollectionsStyle
 
ToString.LocatorToString - interface jdsl.core.ref.ToString.LocatorToString.
Way to parameterize the stringifying of a locator, within the stringifying of a container.
ToString.PositionToString - interface jdsl.core.ref.ToString.PositionToString.
Way to parametrize the stringifying of a position, within the stringifying of a container.
ToString.PositionWritesElementOnly - class jdsl.core.ref.ToString.PositionWritesElementOnly.
Stringifies a position by giving the string representation of the position's element.
ToString.PositionWritesElementOnly() - Constructor for class jdsl.core.ref.ToString.PositionWritesElementOnly
 
ToString.VertexToEmptyString - class jdsl.graph.ref.ToString.VertexToEmptyString.
 
ToString.VertexToEmptyString() - Constructor for class jdsl.graph.ref.ToString.VertexToEmptyString
 
ToString.VertexToString - interface jdsl.graph.ref.ToString.VertexToString.
 
ToString.VertexWritesElementOnly - class jdsl.graph.ref.ToString.VertexWritesElementOnly.
 
ToString.VertexWritesElementOnly() - Constructor for class jdsl.graph.ref.ToString.VertexWritesElementOnly
 
toString() - Method in class jdsl.core.ref.ArraySkipList
Runs in O(n) time, where n is the number of elements.
toString() - Method in class jdsl.core.ref.RedBlackTree
 
toString() - Method in class jdsl.core.ref.NodeCircularSequence
 
toString() - Method in class jdsl.core.ref.HashtableDictionary
O(N) human readable description of the contents of this dictionary, conforming to the Collections spec for key-element structures.
toString() - Method in class jdsl.core.ref.ArrayHeap
time complexity = worst-case O(n)
toString() - Method in class jdsl.core.ref.ArraySequence
O(n) time.
toString() - Method in class jdsl.core.ref.NodeBinaryTree
 
toString() - Method in class jdsl.core.ref.NodeBinaryTree.NBTNode
 
toString() - Method in class jdsl.core.ref.NodeSequence
 
toString() - Method in class jdsl.core.ref.NodeSequence.FNSNode
 
toString() - Method in class jdsl.core.ref.NodeTree
 
toString() - Method in class jdsl.geomobj.api.Point2D.InfinitePoint2D
 
toString() - Method in class jdsl.geomobj.api.GeomObject2D.NoneGeomObject2D
 
toString() - Method in class jdsl.geomobj.ref.AbstractLinearCurve2D
 
toString() - Method in class jdsl.geomobj.ref.RealDirection2D
 
toString() - Method in class jdsl.geomobj.ref.RatDirection2D
 
toString() - Method in class jdsl.geomobj.ref.RealPoint2D
 
toString() - Method in class jdsl.geomobj.ref.IntRectangle2D
 
toString() - Method in class jdsl.geomobj.ref.RatCircle2D
 
toString() - Method in class jdsl.geomobj.ref.IntPoint2D
 
toString() - Method in class jdsl.geomobj.ref.RatPoint2D
 
toString() - Method in class jdsl.geomobj.ref.RatRectangle2D
 
toString() - Method in class jdsl.geomobj.ref.IntCircle2D
 
toString() - Method in class jdsl.geomobj.ref.IntDirection2D
 
toString() - Method in class jdsl.graph.api.Edge.NONEEdge
 
toString() - Method in class jdsl.graph.api.Vertex.NONEVertex
 
toString() - Method in class jdsl.graph.ref.IncidenceListGraph
 
toString() - Method in class jdsl.map.api.Order
 
toString() - Method in class jdsl.map.api.Face.NONEFace
 
traverseBackEdge(Edge, Vertex) - Method in class jdsl.graph.algo.DFS
Called when a back edge is traversed.
traverseBackEdge(Edge, Vertex) - Method in class jdsl.graph.algo.DirectedFindCycleDFS
When a back edge has been encountered, the graph has a cycle.
traverseBackEdge(Edge, Vertex) - Method in class jdsl.graph.algo.FindCycleDFS
When a back edge has been encountered, the graph has a cycle.
traverseCross(Edge, Vertex, Vertex) - Method in class jdsl.graph.algo.BFS
Abstract method called when traversing a cross edge.
traverseCrossEdge(Edge, Vertex) - Method in class jdsl.graph.algo.DFS
Called when a cross edge is traversed.
traverseDiscovery(Edge, Vertex, Vertex) - Method in class jdsl.graph.algo.BFS
Abstract method called when traversing a disocvery edge.
traverseForwardEdge(Edge, Vertex) - Method in class jdsl.graph.algo.DFS
Called when a forward edge is traversed.
traverseTreeEdge(Edge, Vertex) - Method in class jdsl.graph.algo.DFS
Called when a discovery edge is traversed.
Tree - interface jdsl.core.api.Tree.
A positional container representing an ordered tree.
tree_ - Variable in class jdsl.core.algo.traversals.EulerTour
The tree on which the algorithm executes.
TREE_EDGE - Static variable in class jdsl.graph.algo.DFS
Constant signifying that a marked edge is a tree edge.
TREE_NUMBER - Static variable in class jdsl.graph.algo.DFS
Constant used as key to look up the tree to which a Vertex belongs.
treeEdgeFound(Vertex, Edge, int) - Method in class jdsl.graph.algo.IntegerPrimTemplate
Can be overridden to give you a notification when a vertex is added to the minimum spanning tree.
treeEdgeFound(Vertex, Edge, int) - Method in class jdsl.graph.algo.IntegerPrimTreeBuilder
 
treeEdges() - Method in class jdsl.graph.algo.IntegerPrimTreeBuilder
 
treeNum_ - Variable in class jdsl.graph.algo.DFS
The number of the DFS tree being traversed.
treeNumber(Vertex) - Method in class jdsl.graph.algo.DFS
Retrieves an index representing a connected DFS component.
treeToSet(InspectableTree, Set) - Static method in class jdsl.core.util.Converter
Places the contents of a tree into a set
treeWeight - Variable in class jdsl.graph.algo.IntegerPrimTemplate
 
tripartite_ - Variable in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
The underlying representation of the graph
TripartiteEmbeddedPlanarGraph - class jdsl.map.ref.TripartiteEmbeddedPlanarGraph.
An implementation of an EmbeddedPlanarGraph via a tripartite OrderedGraph.
TripartiteEmbeddedPlanarGraph() - Constructor for class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
Creates an initial embedded planar graph consisting of a single vertex, no edges, and one face (the external face).
TripartiteEmbeddedPlanarGraph(TripartiteEmbeddedPlanarGraph) - Constructor for class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
Invoked by createDual().
TwoArgsGeomTests2D - interface jdsl.geomobj.api.TwoArgsGeomTests2D.
A collection of geometric tests taking two arguments.
type(Edge) - Method in class jdsl.graph.algo.DFS
Accesses the current type of the given Edge.

U

UNDIR - Static variable in interface jdsl.graph.api.EdgeDirection
 
undirectedEdges() - Method in interface jdsl.graph.api.InspectableGraph
 
undirectedEdges() - Method in class jdsl.graph.ref.AbstractGraph
Built on edges() and isDirected(.)
UnitWeightedTopologicalNumbering - class jdsl.graph.algo.UnitWeightedTopologicalNumbering.
This algorithm class computes the optimal unit-weighted topological numbering for a given DAG.
UnitWeightedTopologicalNumbering() - Constructor for class jdsl.graph.algo.UnitWeightedTopologicalNumbering
Constructor
UNSEEN - Static variable in class jdsl.graph.algo.DFS
Constant signifying that an edge has not yet been seen.
unsplitEdge(Vertex, Object) - Method in interface jdsl.graph.api.ModifiableGraph
Transforms edge-vertex-edge into a single edge.
unsplitEdge(Vertex, Object) - Method in class jdsl.graph.ref.IncidenceListGraph
Note: the "two" edges incident on v cannot be the same edge.
unsplitEdge(Vertex, Object) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(1)
unsplitEdge(Vertex, Object) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(1)
unsplitVertex(Edge, Object) - Method in interface jdsl.map.api.EmbeddedPlanarGraph
Merges two adjacent vertices and removes the edge(s) connecting them.
unsplitVertex(Edge, Object) - Method in interface jdsl.map.api.OrderedGraph
Merges two adjacent vertices and removes the edge(s) connecting them.
unsplitVertex(Edge, Object) - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
 
unsplitVertex(Edge, Object) - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(degree1+degree2)
UNVISITED - Static variable in class jdsl.graph.algo.DFS
Constant signifying that an vertex has not been visited
updateContainer(Accessor) - Method in class jdsl.core.ref.NodeBinaryTree
Recursively changes the container of all nodes in the subtree anchored at root to this container, adding to _size for each node whose container we change Takes O(S) time -- where S is the number of elements in the subtree

V

vert_to_element_s - Static variable in class jdsl.graph.ref.ToString
 
Vertex - interface jdsl.graph.api.Vertex.
Empty, typing interface for vertices.
VERTEX_STATUS - Static variable in class jdsl.graph.algo.DFS
Constant used as key to look up an vertex's status.
Vertex.NONEVertex - class jdsl.graph.api.Vertex.NONEVertex.
A dummy class, used to implement the constant Vertex.NONE
.
vertex() - Method in interface jdsl.graph.api.VertexIterator
 
vertex() - Method in class jdsl.graph.ref.VertexIteratorAdapter
 
VertexIterator - interface jdsl.graph.api.VertexIterator.
Iterator over a set of vertices.
VertexIteratorAdapter - class jdsl.graph.ref.VertexIteratorAdapter.
Takes an ObjectIterator known to be iterating over things that are Vertices, and makes it appear as an VertexIterator.
VertexIteratorAdapter(ObjectIterator) - Constructor for class jdsl.graph.ref.VertexIteratorAdapter
 
vertexNotReachable(Vertex) - Method in class jdsl.graph.algo.IntegerPrimTemplate
Can be overridden in any application that involves unreachable vertices.
vertexNotReachable(Vertex) - Method in class jdsl.graph.algo.IntegerDijkstraTemplate
Can be overridden in any application that involves unreachable vertices.
vertices() - Method in class jdsl.graph.algo.IntegerDijkstraTemplate
Can be overridden to consider a subset of the vertices in the graph, although I can't think of any reason to do so.
vertices() - Method in interface jdsl.graph.api.InspectableGraph
 
vertices() - Method in class jdsl.graph.ref.InspectableSubgraph
O( V in subgraph )
vertices() - Method in class jdsl.graph.ref.IncidenceListGraph
O(V)
vertices() - Method in class jdsl.map.ref.TripartiteEmbeddedPlanarGraph
O(n)
vertices() - Method in class jdsl.map.ref.IncidenceListOrderedGraph
O(n)
visitBetweenChildren(Position) - Method in class jdsl.core.algo.traversals.EulerTour
Called during execution when a node is visited between visits to its children.
VISITED - Static variable in class jdsl.graph.algo.DFS
Constant signifying that an vertex has been visited
visitExternal(Position) - Method in class jdsl.core.algo.traversals.EulerTour
Called during execution when an external node is visited during the Euler tour.
visitFirstTime(Position) - Method in class jdsl.core.algo.traversals.EulerTour
Called during execution when a node is first visited in the Euler tour.
VISITING - Static variable in class jdsl.graph.algo.DFS
Constant signifying that an vertex is being visited
visitLastTime(Position) - Method in class jdsl.core.algo.traversals.EulerTour
Called during execution when a node is visted for the last time in the Euler tour.
visitResult_ - Variable in class jdsl.graph.algo.DFS
The result of the traversal.

W

w_ - Variable in class jdsl.geomobj.ref.RatPoint2D
 
weight(Edge) - Method in class jdsl.graph.algo.IntegerPrimTemplate
Must be overridden to supply a way of getting a positive weight for every edge in the graph.
weight(Edge) - Method in class jdsl.graph.algo.IntegerPrimTreeBuilder
 
weight(Edge) - Method in class jdsl.graph.algo.IntegerDijkstraTemplate
Must be overridden to supply a way of getting a positive weight for every edge in the graph.
withinHorizontalSpan(Point2D, LinearCurve2D) - Method in interface jdsl.geomobj.api.GeomTester2D
 
withinHorizontalSpan(Point2D, LinearCurve2D) - Method in class jdsl.geomobj.ref.GeomTester2DImpl
 
withinVerticalSpan(Point2D, LinearCurve2D) - Method in interface jdsl.geomobj.api.GeomTester2D
 
withinVerticalSpan(Point2D, LinearCurve2D) - Method in class jdsl.geomobj.ref.GeomTester2DImpl
 
writeNodeAndChildren(Position, ToString.PositionToString, DataOutputStream, InspectableTree, int, int) - Static method in class jdsl.core.ref.ToString
Recursively dumps a byte representation of a subtree onto a stream.

X

x_ - Variable in class jdsl.geomobj.ref.RealPoint2D
 
x_ - Variable in class jdsl.geomobj.ref.IntPoint2D
 
x_ - Variable in class jdsl.geomobj.ref.RatPoint2D
 
X_ALIGNED - Static variable in interface jdsl.geomobj.api.GeomTester2D
 
x() - Method in interface jdsl.geomobj.api.Direction2D
This approximate method is provided for visualization purposes only; computations should be performed through methods of GeomTester2D.
x() - Method in interface jdsl.geomobj.api.Point2D
This approximate method is provided for visualization purposes only; computations should be performed through methods of GeomTester2D.
x() - Method in class jdsl.geomobj.api.Point2D.InfinitePoint2D
 
x() - Method in class jdsl.geomobj.ref.RealDirection2D
 
x() - Method in class jdsl.geomobj.ref.RatDirection2D
 
x() - Method in class jdsl.geomobj.ref.RealPoint2D
 
x() - Method in class jdsl.geomobj.ref.IntPoint2D
 
x() - Method in class jdsl.geomobj.ref.RatPoint2D
 
x() - Method in class jdsl.geomobj.ref.IntDirection2D
 

Y

y_ - Variable in class jdsl.geomobj.ref.RealPoint2D
 
y_ - Variable in class jdsl.geomobj.ref.IntPoint2D
 
y_ - Variable in class jdsl.geomobj.ref.RatPoint2D
 
Y_ALIGNED - Static variable in interface jdsl.geomobj.api.GeomTester2D
 
y() - Method in interface jdsl.geomobj.api.Direction2D
This approximate method is provided for visualization purposes only; computations should be performed through methods of GeomTester2D.
y() - Method in interface jdsl.geomobj.api.Point2D
This approximate method is provided for visualization purposes only; computations should be performed through methods of GeomTester2D.
y() - Method in class jdsl.geomobj.api.Point2D.InfinitePoint2D
 
y() - Method in class jdsl.geomobj.ref.RealDirection2D
 
y() - Method in class jdsl.geomobj.ref.RatDirection2D
 
y() - Method in class jdsl.geomobj.ref.RealPoint2D
 
y() - Method in class jdsl.geomobj.ref.IntPoint2D
 
y() - Method in class jdsl.geomobj.ref.RatPoint2D
 
y() - Method in class jdsl.geomobj.ref.IntDirection2D
 

Z

ZERO - Static variable in class jdsl.geomobj.ref.AbstractLinearCurve2D
 
ZERO - Variable in class jdsl.graph.algo.IntegerPrimTemplate
 

_

_size - Variable in class jdsl.core.ref.NodeBinaryTree
The size of the tree protected so that RestructurableNodeBinaryTree can access it

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z _