Index (gand 0.3.1 API)

A B C D E F G H I J K L M N O P R S T U V W
All Classes and Interfaces|All Packages|Constant Field Values|Serialized Form

A

accept(int) - Method in interface com.github.tommyettinger.gand.utils.IntConsumer: Performs this operation on the given argument.
accept(T) - Method in interface com.github.tommyettinger.gand.utils.ObjectConsumer: Performs this operation on the given argument.
acquire(int, int) - Method in class com.github.tommyettinger.gand.GradientGrid: The main extension point for GradientGrid, this must be implemented with some way of obtaining a P instance, which might simply be return new PointI2(x, y); if P is PointI2.
acquire(int, int) - Method in class com.github.tommyettinger.gand.GradientGridI2
acquire(Point2<?>) - Method in class com.github.tommyettinger.gand.GradientGrid: Simply calls GradientGrid.acquire(int, int) with (other.xi(), other.yi()).
add(int) - Method in interface com.github.tommyettinger.gand.ds.IntCollection
add(int) - Method in class com.github.tommyettinger.gand.ds.IntDeque: Inserts the specified element into the queue represented by this deque (in other words, at the tail of this deque) if it is possible to do so immediately without violating capacity restrictions, returning true upon success and throwing an IllegalStateException if no space is currently available.
add(int) - Method in class com.github.tommyettinger.gand.ds.IntDeque.IntDequeIterator: Inserts the specified element into the list (optional operation).
add(int) - Method in class com.github.tommyettinger.gand.ds.IntList
add(int) - Method in class com.github.tommyettinger.gand.ds.IntList.IntListIterator: Inserts the specified element into the list (optional operation).
add(int, int) - Method in class com.github.tommyettinger.gand.ds.IntDeque: Inserts the specified element into this deque at the specified index.
add(int, int) - Method in class com.github.tommyettinger.gand.ds.IntList
add(int, int, int) - Method in class com.github.tommyettinger.gand.ds.IntList
add(int, int, int, int) - Method in class com.github.tommyettinger.gand.ds.IntList
add(int, T) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Inserts the specified element into this deque at the specified index.
add(int, T) - Method in class com.github.tommyettinger.gand.ds.ObjectOrderedSet: Sets the key at the specified index.
add(T) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Inserts the specified element into the queue represented by this deque (in other words, at the tail of this deque) if it is possible to do so immediately without violating capacity restrictions, returning true upon success and throwing an IllegalStateException if no space is currently available.
add(T) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque.ObjectDequeIterator: Inserts the specified element into the list (optional operation).
add(T) - Method in class com.github.tommyettinger.gand.ds.ObjectOrderedSet
add(T) - Method in class com.github.tommyettinger.gand.ds.ObjectSet: Returns true if the key was not already in the set.
addAll(int[]) - Method in interface com.github.tommyettinger.gand.ds.IntCollection
addAll(int...) - Method in class com.github.tommyettinger.gand.ds.IntList
addAll(int[], int, int) - Method in interface com.github.tommyettinger.gand.ds.IntCollection
addAll(int[], int, int) - Method in class com.github.tommyettinger.gand.ds.IntList
addAll(int, List<? extends T>, int, int) - Method in class com.github.tommyettinger.gand.ds.ObjectOrderedSet: Adds up to count items, starting from offset, in the Ordered other to this set, inserting starting at insertionIndex in the iteration order.
addAll(IntCollection) - Method in interface com.github.tommyettinger.gand.ds.IntCollection
addAll(IntList) - Method in class com.github.tommyettinger.gand.ds.IntList
addAll(IntList, int, int) - Method in class com.github.tommyettinger.gand.ds.IntList
addAll(ObjectSet<T>) - Method in class com.github.tommyettinger.gand.ds.ObjectSet
addAll(Collection<? extends T>) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Adds all of the elements in the specified collection at the end of this deque, as if by calling ObjectDeque.addLast(T) on each one, in the order that they are returned by the collection's iterator.
addAll(Collection<? extends T>) - Method in class com.github.tommyettinger.gand.ds.ObjectSet
addAll(List<? extends T>, int, int) - Method in class com.github.tommyettinger.gand.ds.ObjectOrderedSet: Adds up to count items, starting from offset, in the Ordered other to this set, inserting at the end of the iteration order.
addAll(T[]) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Exactly like ObjectDeque.addAll(Collection), but takes an array instead of a Collection.
addAll(T[]) - Method in class com.github.tommyettinger.gand.ds.ObjectSet
addAll(T[], int, int) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Like ObjectDeque.addAll(Object[]), but only uses at most length items from array, starting at offset.
addAll(T[], int, int) - Method in class com.github.tommyettinger.gand.ds.ObjectSet
addConnection(Node<V>, Node<V>, float) - Method in class com.github.tommyettinger.gand.Internals
addEdge(Edge<V>) - Method in class com.github.tommyettinger.gand.Graph: Add an edge to the graph, with the same endpoints as the given edge.
addEdge(V, V) - Method in class com.github.tommyettinger.gand.Graph: Add an edge to the graph, from v to w.
addEdge(V, V, float) - Method in class com.github.tommyettinger.gand.Graph: Add an edge to the graph, from v to w and with the specified weight.
addFirst(int) - Method in class com.github.tommyettinger.gand.ds.IntDeque: Prepend given item to the head (enqueue to head).
addFirst(T) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Prepend given object to the head (enqueue to head).
addLast(int) - Method in class com.github.tommyettinger.gand.ds.IntDeque: Append given item to the tail (enqueue to tail).
addLast(T) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Append given object to the tail (enqueue to tail).
addResize(T) - Method in class com.github.tommyettinger.gand.ds.ObjectSet: Like ObjectSet.add(Object), but skips checks for existing keys, and doesn't increment size.
addVertex(PointI2) - Method in class com.github.tommyettinger.gand.Int2DirectedGraph: Adds a vertex to the graph.
addVertex(PointI2) - Method in class com.github.tommyettinger.gand.Int2UndirectedGraph: Adds a vertex to the graph.
addVertex(PointI3) - Method in class com.github.tommyettinger.gand.Int3DirectedGraph: Adds a vertex to the graph.
addVertex(PointI3) - Method in class com.github.tommyettinger.gand.Int3UndirectedGraph: Adds a vertex to the graph.
addVertex(V) - Method in class com.github.tommyettinger.gand.Graph: Adds a vertex to the graph.
addVertices(Collection<V>) - Method in class com.github.tommyettinger.gand.Graph: Adds all the vertices in the collection to the graph.
addVertices(V...) - Method in class com.github.tommyettinger.gand.Graph
Algorithm<V> - Class in com.github.tommyettinger.gand.algorithms
Algorithm(int) - Constructor for class com.github.tommyettinger.gand.algorithms.Algorithm
algorithms - Variable in class com.github.tommyettinger.gand.DirectedGraph
algorithms - Variable in class com.github.tommyettinger.gand.UndirectedGraph
algorithms() - Method in class com.github.tommyettinger.gand.DirectedGraph
algorithms() - Method in class com.github.tommyettinger.gand.Graph
algorithms() - Method in class com.github.tommyettinger.gand.UndirectedGraph
Algorithms<V> - Class in com.github.tommyettinger.gand.algorithms
alter(T, T) - Method in class com.github.tommyettinger.gand.ds.ObjectOrderedSet: Changes the item before to after without changing its position in the order.
alterAt(int, T) - Method in class com.github.tommyettinger.gand.ds.ObjectOrderedSet: Changes the item at the given index in the order to after, without changing the ordering of other items.
appendInto(Collection<T>) - Method in class com.github.tommyettinger.gand.ds.ObjectSet.ObjectSetIterator: Append the remaining items that this can iterate through into the given Collection.
appendTo(StringBuilder, String) - Method in class com.github.tommyettinger.gand.ds.ObjectSet
areEqual(Object) - Method in interface com.github.tommyettinger.gand.ds.IntCollection: Compares this IntCollection with another IntCollection by checking their identity, their types (both must implement IntCollection), and their sizes, before checking if other contains each item in this IntCollection, in any order or quantity.
asIntComparator(Comparator<? super Integer>) - Static method in class com.github.tommyettinger.gand.utils.IntComparators: Returns a type-specific comparator that is equivalent to the given comparator.
AStarSearch<V> - Class in com.github.tommyettinger.gand.algorithms
AStarSearch(int, Node<V>, Node<V>, Heuristic<V>, SearchProcessor<V>) - Constructor for class com.github.tommyettinger.gand.algorithms.AStarSearch

B

blocked - Variable in class com.github.tommyettinger.gand.GradientGrid
blockingRequirement - Variable in class com.github.tommyettinger.gand.GradientGrid
breadthFirstSearch(V, SearchProcessor<V>) - Method in class com.github.tommyettinger.gand.algorithms.Algorithms: Perform a breadth first search starting from the specified vertex.
BreadthFirstSearch<V> - Class in com.github.tommyettinger.gand.algorithms
BreadthFirstSearch(int, Node<V>, SearchProcessor<V>) - Constructor for class com.github.tommyettinger.gand.algorithms.BreadthFirstSearch
Bresenham2DRaycastCollisionDetector> - Class in com.github.tommyettinger.gand.smoothing: A raycast collision detector used for path smoothing in 2D, with cells considered passable if a predicate returns true.
Bresenham2DRaycastCollisionDetector(IntIntPredicate) - Constructor for class com.github.tommyettinger.gand.smoothing.Bresenham2DRaycastCollisionDetector: Creates a Bresenham2DRaycastCollisionDetector that uses the given predicate to determine if an x,y cell is passable.
Bresenham3DRaycastCollisionDetector> - Class in com.github.tommyettinger.gand.smoothing: A raycast collision detector used for path smoothing in 3D, with cells considered passable if a predicate returns true.
Bresenham3DRaycastCollisionDetector(IntIntIntPredicate) - Constructor for class com.github.tommyettinger.gand.smoothing.Bresenham3DRaycastCollisionDetector: Creates a Bresenham3DRaycastCollisionDetector that uses the given predicate to determine if an x,y,z cell is passable.
buildCompleteGraph(G) - Static method in class com.github.tommyettinger.gand.GraphBuilder

C

cachedFearSources - Variable in class com.github.tommyettinger.gand.GradientGrid
cachedFleeMap - Variable in class com.github.tommyettinger.gand.GradientGrid
cachedImpassable - Variable in class com.github.tommyettinger.gand.GradientGrid
cachedLongerPaths - Variable in class com.github.tommyettinger.gand.GradientGrid
CARDINALS - Static variable in enum class com.github.tommyettinger.gand.utils.Direction: An array which holds only the four cardinal directions.
CARDINALS_CLOCKWISE - Static variable in enum class com.github.tommyettinger.gand.utils.Direction: An array which holds only the four cardinal directions in clockwise order.
CARDINALS_COUNTERCLOCKWISE - Static variable in enum class com.github.tommyettinger.gand.utils.Direction: An array which holds only the four cardinal directions in counter-clockwise order.
CHEBYSHEV - Enum constant in enum class com.github.tommyettinger.gand.utils.GridMetric: The distance it takes when diagonal movement costs the same as cardinal movement.
Choo32Random - Class in com.github.tommyettinger.gand.utils: A random number generator that is optimized for performance on 32-bit machines and with Google Web Toolkit.
Choo32Random() - Constructor for class com.github.tommyettinger.gand.utils.Choo32Random: Creates a new Choo32Random with a random state.
Choo32Random(int) - Constructor for class com.github.tommyettinger.gand.utils.Choo32Random: Creates a new Choo32Random with the given seed; all int values are permitted.
Choo32Random(int, int, int, int) - Constructor for class com.github.tommyettinger.gand.utils.Choo32Random: Creates a new Choo32Random with the given four states; all int values are permitted.
Choo32Random(long) - Constructor for class com.github.tommyettinger.gand.utils.Choo32Random: Creates a new Choo32Random with the given seed; all long values are permitted.
clear() - Method in interface com.github.tommyettinger.gand.ds.IntCollection
clear() - Method in class com.github.tommyettinger.gand.ds.IntDeque: Removes all values from this queue.
clear() - Method in class com.github.tommyettinger.gand.ds.IntList: Effectively removes all items from this IntList.
clear() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Removes all values from this queue.
clear() - Method in class com.github.tommyettinger.gand.ds.ObjectOrderedSet
clear() - Method in class com.github.tommyettinger.gand.ds.ObjectSet: Clears the set, leaving the backing arrays at the current capacity.
clear() - Method in class com.github.tommyettinger.gand.Graph: An alias for Graph.removeAllVertices(), this removes all vertices and all edges from the graph.
clear(int) - Method in class com.github.tommyettinger.gand.ds.ObjectOrderedSet
clear(int) - Method in class com.github.tommyettinger.gand.ds.ObjectSet: Clears the set and reduces the size of the backing arrays to be the specified capacity / loadFactor, if they are larger.
clearGoals() - Method in class com.github.tommyettinger.gand.GradientGrid: Used to remove all goals and undo any changes to gradientMap made by having a goal present.
CLOCKWISE - Static variable in enum class com.github.tommyettinger.gand.utils.Direction: An array which holds all eight OUTWARDS directions in clockwise order.
collides(PointPair) - Method in class com.github.tommyettinger.gand.smoothing.Bresenham2DRaycastCollisionDetector: Draws a line using Bresenham's line algorithm to see if all cells in the line are passable; if any cell was not passable, then this returns true (meaning there is a collision).
collides(PointPair) - Method in class com.github.tommyettinger.gand.smoothing.Bresenham3DRaycastCollisionDetector: Draws a line using Bresenham's line algorithm to see if all cells in the line are passable; if any cell was not passable, then this returns true (meaning there is a collision).
collides(PointPair) - Method in class com.github.tommyettinger.gand.smoothing.Ortho2DRaycastCollisionDetector: Draws a line using a simple orthogonal line algorithm to see if all cells in the line are passable; if any cell was not passable, then this returns true (meaning there is a collision).
collides(PointPair) - Method in class com.github.tommyettinger.gand.smoothing.Ortho3DRaycastCollisionDetector: Draws a line using a simple orthogonal line algorithm to see if all cells in the line are passable; if any cell was not passable, then this returns true (meaning there is a collision).
collides(PointPair, IntIntIntPredicate) - Static method in class com.github.tommyettinger.gand.smoothing.Bresenham3DRaycastCollisionDetector: Draws a line using Bresenham's line algorithm to see if all cells in the line are passable; if any cell was not passable, then this returns true (meaning there is a collision).
collides(PointPair, IntIntIntPredicate) - Static method in class com.github.tommyettinger.gand.smoothing.Ortho3DRaycastCollisionDetector: Draws a line using a simple orthogonal line algorithm to see if all cells in the line are passable; if any cell was not passable, then this returns true (meaning there is a collision).
collides(PointPair, IntIntPredicate) - Static method in class com.github.tommyettinger.gand.smoothing.Bresenham2DRaycastCollisionDetector: Draws a line using Bresenham's line algorithm to see if all cells in the line are passable; if any cell was not passable, then this returns true (meaning there is a collision).
collides(PointPair, IntIntPredicate) - Static method in class com.github.tommyettinger.gand.smoothing.Ortho2DRaycastCollisionDetector: Draws a line using a simple orthogonal line algorithm to see if all cells in the line are passable; if any cell was not passable, then this returns true (meaning there is a collision).
collides(PointPair<T>) - Method in interface com.github.tommyettinger.gand.smoothing.RaycastCollisionDetector: Casts the given ray to test if it collides with any objects in the game world.
com.github.tommyettinger.gand - package com.github.tommyettinger.gand
com.github.tommyettinger.gand.algorithms - package com.github.tommyettinger.gand.algorithms
com.github.tommyettinger.gand.ds - package com.github.tommyettinger.gand.ds
com.github.tommyettinger.gand.smoothing - package com.github.tommyettinger.gand.smoothing
com.github.tommyettinger.gand.utils - package com.github.tommyettinger.gand.utils
compare(int, int) - Method in interface com.github.tommyettinger.gand.utils.IntComparator: Compares its two primitive-type arguments for order.
compare(int, int) - Method in class com.github.tommyettinger.gand.utils.IntComparators.NaturalImplicitComparator
compare(int, int) - Method in class com.github.tommyettinger.gand.utils.IntComparators.OppositeComparator
compare(int, int) - Method in class com.github.tommyettinger.gand.utils.IntComparators.OppositeImplicitComparator
compare(int, int) - Method in class com.github.tommyettinger.gand.utils.IntComparators.UnsignedComparator
compare(int, int) - Method in class com.github.tommyettinger.gand.utils.IntComparators.UnsignedOppositeComparator
compare(Integer, Integer) - Method in interface com.github.tommyettinger.gand.utils.IntComparator: Deprecated.
Please use the corresponding type-specific method instead.
Compatibility - Class in com.github.tommyettinger.gand.utils: Various methods that have different implementations on GWT, such as Compatibility.imul(int, int) to multiply two ints and get an int that is guaranteed to act like it does on desktop.
connectAdjacent(Heuristic<PointI2>, boolean) - Method in class com.github.tommyettinger.gand.Int2DirectedGraph: Adds edges between all pairs of adjacent vertices, where adjacency is 4-way if permitDiagonal is false, or 8-way if it is true.
connectAdjacent(Heuristic<PointI2>, boolean) - Method in class com.github.tommyettinger.gand.Int2UndirectedGraph: Adds edges between all pairs of adjacent vertices, where adjacency is 4-way if permitDiagonal is false, or 8-way if it is true.
connectAdjacent(Heuristic<PointI3>, boolean) - Method in class com.github.tommyettinger.gand.Int3DirectedGraph: Adds edges between all pairs of adjacent vertices, where adjacency is 6-way if permitDiagonal is false, or 26-way if it is true.
connectAdjacent(Heuristic<PointI3>, boolean) - Method in class com.github.tommyettinger.gand.Int3UndirectedGraph: Adds edges between all pairs of adjacent vertices, where adjacency is 6-way if permitDiagonal is false, or 26-way if it is true.
Connection<V> - Class in com.github.tommyettinger.gand
Connection.DirectedConnection<V> - Class in com.github.tommyettinger.gand
Connection.UndirectedConnection<V> - Class in com.github.tommyettinger.gand
contains(int) - Method in interface com.github.tommyettinger.gand.ds.IntCollection
contains(int) - Method in class com.github.tommyettinger.gand.ds.IntDeque: Returns true if this deque contains the specified element.
contains(int) - Method in class com.github.tommyettinger.gand.ds.IntList
contains(Object) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Returns true if this deque contains the specified element.
contains(Object) - Method in class com.github.tommyettinger.gand.ds.ObjectSet
contains(V) - Method in class com.github.tommyettinger.gand.Graph: Check if the graph contains a vertex.
containsAll(int[]) - Method in interface com.github.tommyettinger.gand.ds.IntCollection
containsAll(int[], int, int) - Method in interface com.github.tommyettinger.gand.ds.IntCollection
containsAll(IntCollection) - Method in interface com.github.tommyettinger.gand.ds.IntCollection
containsAll(IntList) - Method in class com.github.tommyettinger.gand.ds.IntList: Returns true if this IntList contains, at least once, every item in other; otherwise returns false.
containsAll(Object[]) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Exactly like ObjectDeque.containsAll(Collection), but takes an array instead of a Collection.
containsAll(Object[]) - Method in class com.github.tommyettinger.gand.ds.ObjectSet: Exactly like ObjectSet.containsAll(Collection), but takes an array instead of a Collection.
containsAll(Object[], int, int) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Like ObjectDeque.containsAll(Object[]), but only uses at most length items from array, starting at offset.
containsAll(Object[], int, int) - Method in class com.github.tommyettinger.gand.ds.ObjectSet: Like ObjectSet.containsAll(Object[]), but only uses at most length items from array, starting at offset.
containsAll(Collection<?>) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Returns true if this collection contains all of the elements in the specified collection.
containsAll(Collection<?>) - Method in class com.github.tommyettinger.gand.ds.ObjectSet
containsAny(int[]) - Method in interface com.github.tommyettinger.gand.ds.IntCollection
containsAny(int[], int, int) - Method in interface com.github.tommyettinger.gand.ds.IntCollection
containsAny(IntCollection) - Method in interface com.github.tommyettinger.gand.ds.IntCollection
containsAny(Iterable<?>) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Returns true if this ObjectDeque contains any of the specified values.
containsAny(Iterable<?>) - Method in class com.github.tommyettinger.gand.ds.ObjectSet: Returns true if this set contains any of the specified values.
containsAny(Object[]) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Returns true if this ObjectDeque contains any of the specified values.
containsAny(Object[]) - Method in class com.github.tommyettinger.gand.ds.ObjectSet: Returns true if this set contains any of the specified values.
containsAny(Object[], int, int) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Returns true if this ObjectDeque contains any items from the specified range of values.
containsAny(Object[], int, int) - Method in class com.github.tommyettinger.gand.ds.ObjectSet: Returns true if this set contains any items from the specified range of values.
containsCycle() - Method in class com.github.tommyettinger.gand.algorithms.Algorithms: Checks whether there are any cycles in the graph using depth first searches.
containsCycle() - Method in class com.github.tommyettinger.gand.algorithms.CycleDetector
copy() - Method in class com.github.tommyettinger.gand.utils.Choo32Random
copy() - Method in class com.github.tommyettinger.gand.utils.FlowRandom
copy() - Method in class com.github.tommyettinger.gand.utils.Taxon32Random
copy(float[][]) - Static method in class com.github.tommyettinger.gand.GradientGrid: Gets a copy of the 2D float array, source, that has the same data but shares no references with source.
count() - Method in class com.github.tommyettinger.gand.algorithms.SearchStep
COUNTERCLOCKWISE - Static variable in enum class com.github.tommyettinger.gand.utils.Direction: An array which holds all eight OUTWARDS directions in counter-clockwise order.
countLeadingZeros(int) - Static method in class com.github.tommyettinger.gand.utils.Compatibility: Returns the number of contiguous '0' bits in n starting at the sign bit and checking towards the least-significant bit, stopping just before a '1' bit is encountered.
countLeadingZeros(long) - Static method in class com.github.tommyettinger.gand.utils.Compatibility: Returns the number of contiguous '0' bits in n starting at the sign bit and checking towards the least-significant bit, stopping just before a '1' bit is encountered.
countTrailingZeros(int) - Static method in class com.github.tommyettinger.gand.utils.Compatibility: Returns the number of contiguous '0' bits in n starting at the least-significant bit and checking towards the sign bit, stopping just before a '1' bit is encountered.
countTrailingZeros(long) - Static method in class com.github.tommyettinger.gand.utils.Compatibility: Returns the number of contiguous '0' bits in n starting at the least-significant bit and checking towards the sign bit, stopping just before a '1' bit is encountered.
createNew() - Method in class com.github.tommyettinger.gand.DirectedGraph
createNew() - Method in class com.github.tommyettinger.gand.Float2DirectedGraph
createNew() - Method in class com.github.tommyettinger.gand.Float2UndirectedGraph
createNew() - Method in class com.github.tommyettinger.gand.Float3DirectedGraph
createNew() - Method in class com.github.tommyettinger.gand.Float3UndirectedGraph
createNew() - Method in class com.github.tommyettinger.gand.Graph
createNew() - Method in class com.github.tommyettinger.gand.Int2DirectedGraph
createNew() - Method in class com.github.tommyettinger.gand.Int2UndirectedGraph
createNew() - Method in class com.github.tommyettinger.gand.Int3DirectedGraph
createNew() - Method in class com.github.tommyettinger.gand.Int3UndirectedGraph
createNew() - Method in class com.github.tommyettinger.gand.UndirectedGraph
createPath() - Method in class com.github.tommyettinger.gand.algorithms.SearchStep: Reconstruct the path from the initial vertex to the current vertex that the search algorithm took.
currentIndex - Variable in class com.github.tommyettinger.gand.ds.ObjectSet.ObjectSetIterator: The current index in the set's key table; this is the index that will be removed if ObjectSet.ObjectSetIterator.remove() is called.
cutShort - Variable in class com.github.tommyettinger.gand.GradientGrid: This is set to true if a path was forced to stop due to length limits, and set to false if a complete path was found.
CycleDetector<V> - Class in com.github.tommyettinger.gand.algorithms
CycleDetector(int, Graph<V>) - Constructor for class com.github.tommyettinger.gand.algorithms.CycleDetector

D

DARK - Static variable in class com.github.tommyettinger.gand.GradientGrid: This is used to mark cells that the scan couldn't reach, and these dark cells are marked with a high number equal to 999800f .
decode(Point2<?>, int) - Method in class com.github.tommyettinger.gand.GradientGrid: If you for some reason have one of the internally-used ints produced by GradientGrid.encode(Point2), this will write it into a Point2 if you need it as such.
decodeX(int) - Method in class com.github.tommyettinger.gand.GradientGrid: If you for some reason have one of the internally-used ints produced by GradientGrid.encode(Point2), this will decode the x component of the point encoded in that int.
decodeY(int) - Method in class com.github.tommyettinger.gand.GradientGrid: If you for some reason have one of the internally-used ints produced by GradientGrid.encode(Point2), this will decode the y component of the point encoded in that int.
defaultEdgeWeight - Variable in class com.github.tommyettinger.gand.Graph
defaultLoadFactor - Static variable in class com.github.tommyettinger.gand.ds.Utilities
defaultValue - Variable in class com.github.tommyettinger.gand.ds.IntDeque
defaultValue - Variable in class com.github.tommyettinger.gand.ds.ObjectDeque: The value returned when nothing can be obtained from this deque and an exception is not meant to be thrown, such as when calling ObjectDeque.peek() on an empty deque.
deltaX - Variable in enum class com.github.tommyettinger.gand.utils.Direction: The x coordinate difference for this direction.
deltaY - Variable in enum class com.github.tommyettinger.gand.utils.Direction: The y coordinate difference for this direction.
depth() - Method in class com.github.tommyettinger.gand.algorithms.SearchStep
depthFirstSearch(V, SearchProcessor<V>) - Method in class com.github.tommyettinger.gand.algorithms.Algorithms: Perform a depth first search starting from the specified vertex.
DepthFirstSearch<V> - Class in com.github.tommyettinger.gand.algorithms
DepthFirstSearch(int, Node<V>, SearchProcessor<V>) - Constructor for class com.github.tommyettinger.gand.algorithms.DepthFirstSearch
deque - Variable in class com.github.tommyettinger.gand.ds.IntDeque.IntDequeIterator
deque - Variable in class com.github.tommyettinger.gand.ds.ObjectDeque.ObjectDequeIterator
descendingIterator() - Method in class com.github.tommyettinger.gand.ds.IntDeque: Returns an iterator over the elements in this deque in reverse sequential order.
descendingIterator() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Returns an iterator over the elements in this deque in reverse sequential order.
descendingIterator1 - Variable in class com.github.tommyettinger.gand.ds.IntDeque
descendingIterator1 - Variable in class com.github.tommyettinger.gand.ds.ObjectDeque
descendingIterator2 - Variable in class com.github.tommyettinger.gand.ds.IntDeque
descendingIterator2 - Variable in class com.github.tommyettinger.gand.ds.ObjectDeque
deserializeFromString(String) - Method in class com.github.tommyettinger.gand.utils.Choo32Random: Given a String produced by Choo32Random.serializeToString(), this sets the state of this Choo32Random to the state stored in that String.This does not deserialize any fields inherited from Random, so the methods that use Random's side entirely, such as the Stream methods, won't be affected by this state.
deserializeFromString(String) - Method in class com.github.tommyettinger.gand.utils.FlowRandom: Given a String produced by FlowRandom.serializeToString(), this sets the state of this FlowRandom to the state stored in that String.This does not deserialize any fields inherited from Random, so the methods that use Random's side entirely, such as the Stream methods, won't be affected by this state.
deserializeFromString(String) - Method in class com.github.tommyettinger.gand.utils.Taxon32Random: Given a String produced by Taxon32Random.serializeToString(), this sets the state of this Taxon32Random to the state stored in that String.This does not deserialize any fields inherited from Random, so the methods that use Random's side entirely, such as the Stream methods, won't be affected by this state.
DIAGONALS - Static variable in enum class com.github.tommyettinger.gand.utils.Direction: An array which holds only the four diagonal directions.
dijkstraSearch(V, SearchProcessor<V>) - Method in class com.github.tommyettinger.gand.algorithms.Algorithms: Perform a search using Dijkstra's algorithm starting from the specified vertex.
DirectedConnection() - Constructor for class com.github.tommyettinger.gand.Connection.DirectedConnection
DirectedGraph<V> - Class in com.github.tommyettinger.gand
DirectedGraph() - Constructor for class com.github.tommyettinger.gand.DirectedGraph
DirectedGraph(Graph<V>) - Constructor for class com.github.tommyettinger.gand.DirectedGraph
DirectedGraph(Collection<V>) - Constructor for class com.github.tommyettinger.gand.DirectedGraph
DirectedGraph(Collection<V>, Collection<Edge<V>>, float) - Constructor for class com.github.tommyettinger.gand.DirectedGraph
DirectedGraphAlgorithms<V> - Class in com.github.tommyettinger.gand.algorithms
DirectedGraphAlgorithms(DirectedGraph<V>) - Constructor for class com.github.tommyettinger.gand.algorithms.DirectedGraphAlgorithms
Direction - Enum Class in com.github.tommyettinger.gand.utils: Represents the eight grid directions and the deltaX, deltaY values associated with those directions.
directionCount() - Method in enum class com.github.tommyettinger.gand.utils.GridMetric
dirs - Variable in class com.github.tommyettinger.gand.GradientGrid
disconnect() - Method in class com.github.tommyettinger.gand.Node
disconnect(Node<V>) - Method in class com.github.tommyettinger.gand.Graph
disconnect(V) - Method in class com.github.tommyettinger.gand.Graph
distance() - Method in class com.github.tommyettinger.gand.algorithms.SearchStep
div(int) - Method in class com.github.tommyettinger.gand.ds.IntList: Divides each item in this IntList by value, stores it in this and returns it.
div(int, int) - Method in class com.github.tommyettinger.gand.ds.IntList
DOWN - Enum constant in enum class com.github.tommyettinger.gand.utils.Direction
DOWN_LEFT - Enum constant in enum class com.github.tommyettinger.gand.utils.Direction
DOWN_RIGHT - Enum constant in enum class com.github.tommyettinger.gand.utils.Direction
duplicateRange(int, int) - Method in class com.github.tommyettinger.gand.ds.IntList: Inserts the specified number of items at the specified index.

E

edge() - Method in class com.github.tommyettinger.gand.algorithms.SearchStep
Edge<V> - Class in com.github.tommyettinger.gand
edgeExists(V, V) - Method in class com.github.tommyettinger.gand.Graph: Check if the graph contains an edge from v to w.
edgeSet - Variable in class com.github.tommyettinger.gand.Graph: This is a map so that for undirected graphs, a consistent edge instance can be obtained from either (u, v) or (v, u)
element() - Method in class com.github.tommyettinger.gand.ds.IntDeque: Retrieves, but does not remove, the head of the queue represented by this deque (in other words, the first element of this deque).
element() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Retrieves, but does not remove, the head of the queue represented by this deque (in other words, the first element of this deque).
EMPTY_PATH - Static variable in class com.github.tommyettinger.gand.Path
encode(int, int) - Method in class com.github.tommyettinger.gand.GradientGrid: Internally, GradientGrid uses int primitives instead of Point2 objects.
encode(Point2<?>) - Method in class com.github.tommyettinger.gand.GradientGrid: Internally, GradientGrid uses int primitives instead of Point2 objects.
ensureCapacity(int) - Method in class com.github.tommyettinger.gand.ds.IntDeque: Increases the size of the backing array to accommodate the specified number of additional items.
ensureCapacity(int) - Method in class com.github.tommyettinger.gand.ds.IntList: Increases the size of the backing array to accommodate the specified number of additional items.
ensureCapacity(int) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Increases the size of the backing array to accommodate the specified number of additional items.
ensureCapacity(int) - Method in class com.github.tommyettinger.gand.ds.ObjectOrderedSet: Increases the size of the backing array to accommodate the specified number of additional items / loadFactor.
ensureCapacity(int) - Method in class com.github.tommyettinger.gand.ds.ObjectSet: Increases the size of the backing array to accommodate the specified number of additional items / loadFactor.
equals(Object) - Method in class com.github.tommyettinger.gand.Connection.DirectedConnection
equals(Object) - Method in class com.github.tommyettinger.gand.Connection.UndirectedConnection
equals(Object) - Method in interface com.github.tommyettinger.gand.ds.IntCollection
equals(Object) - Method in class com.github.tommyettinger.gand.ds.IntDeque
equals(Object) - Method in class com.github.tommyettinger.gand.ds.IntList
equals(Object) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Using Object.equals(Object) between each item in order, compares for equality specifically with other ObjectDeque collections.
equals(Object) - Method in class com.github.tommyettinger.gand.ds.ObjectSet
equals(Object) - Method in class com.github.tommyettinger.gand.Graph
equals(Object) - Method in class com.github.tommyettinger.gand.Node
equals(Object) - Method in class com.github.tommyettinger.gand.Path
equals(Object) - Method in class com.github.tommyettinger.gand.utils.Choo32Random
equals(Object) - Method in class com.github.tommyettinger.gand.utils.FlowRandom
equals(Object) - Method in class com.github.tommyettinger.gand.utils.Taxon32Random
equalsIdentity(Object) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Using == between each item in order, compares for equality specifically with other ObjectDeque collections.
equate(Object, Object) - Method in class com.github.tommyettinger.gand.ds.ObjectSet: Compares the objects left and right, which are usually keys, for equality, returning true if they are considered equal.
Errors - Class in com.github.tommyettinger.gand.utils
Errors() - Constructor for class com.github.tommyettinger.gand.utils.Errors
EUCLIDEAN - Enum constant in enum class com.github.tommyettinger.gand.utils.GridMetric: The distance it takes as the crow flies.

F

findAttackPath(int, int, int, boolean, Collection<? extends Point2<?>>, Collection<? extends Point2<?>>, Point2<?>, Collection<? extends Point2<?>>) - Method in class com.github.tommyettinger.gand.GradientGrid: Scans the dungeon using GradientGrid.scan with the listed goals and start point, and returns a deque of P positions (using the current measurement) needed to get closer to a goal, until a cell is reached with a distance from a goal that is at least equal to minPreferredRange and no more than maxPreferredRange, which may go further from a goal if the minPreferredRange has not been met at the current distance.
findAttackPath(int, int, Collection<? extends Point2<?>>, boolean, Collection<? extends Point2<?>>, Point2<?>, Collection<? extends Point2<?>>) - Method in class com.github.tommyettinger.gand.GradientGrid: Scans the dungeon using GradientGrid.scan with the listed goals and start point, and returns a deque of P positions (using the current measurement) needed to get closer to a goal, until preferredRange is reached, or further from a goal if the preferredRange has not been met at the current distance.
findAttackPath(ObjectDeque, int, int, int, boolean, Collection<? extends Point2<?>>, Collection<? extends Point2<?>>, Point2<?>, Collection<? extends Point2<?>>) - Method in class com.github.tommyettinger.gand.GradientGrid: Scans the dungeon using GradientGrid.scan with the listed goals and start point, and returns a deque of P positions (using the current measurement) needed to get closer to a goal, until a cell is reached with a distance from a goal that is at least equal to minPreferredRange and no more than maxPreferredRange, which may go further from a goal if the minPreferredRange has not been met at the current distance.
findCollision(PointPair<T>, PointPair<T>) - Method in interface com.github.tommyettinger.gand.smoothing.RaycastCollisionDetector: Find the closest collision between the given input ray and the objects in the game world.
findFleePath(int, float, Collection<? extends Point2<?>>, Collection<? extends Point2<?>>, Point2<?>, Collection<Point2<?>>) - Method in class com.github.tommyettinger.gand.GradientGrid: Scans the dungeon using GradientGrid.scan() with the listed fearSources and start point, and returns a deque of P positions (using Manhattan distance) needed to get further from the closest fearSources, meant for running away.
findFleePath(int, int, float, Collection<? extends Point2<?>>, Collection<? extends Point2<?>>, Point2<?>, Collection<Point2<?>>) - Method in class com.github.tommyettinger.gand.GradientGrid: Scans the dungeon using GradientGrid.scan or GradientGrid.partialScan with the listed fearSources and start point, and returns a deque of P positions (using this GradientGrid's metric) needed to get further from the closest fearSources, meant for running away.
findFleePath(ObjectDeque, int, int, float, Collection<? extends Point2<?>>, Collection<? extends Point2<?>>, Point2<?>, Collection<Point2<?>>) - Method in class com.github.tommyettinger.gand.GradientGrid: Scans the dungeon using GradientGrid.scan or GradientGrid.partialScan with the listed fearSources and start point, and returns a deque of P positions (using this GradientGrid's metric) needed to get further from the closest fearSources, meant for running away.
findMinimumDistance(V, V) - Method in class com.github.tommyettinger.gand.algorithms.Algorithms: Find the length of a shortest path from the start vertex to the target vertex, using Dijkstra's algorithm implemented with a priority queue.
findMinimumDistance(V, V, Heuristic<V>) - Method in class com.github.tommyettinger.gand.algorithms.Algorithms: Find the length of a shortest path from the start vertex to the target vertex, using the A* search algorithm with the provided heuristic, and implemented with a priority queue.
findMinimumWeightSpanningTree() - Method in class com.github.tommyettinger.gand.algorithms.UndirectedGraphAlgorithms: Find a minimum weight spanning tree using Kruskal's algorithm.
findNextIndex() - Method in class com.github.tommyettinger.gand.ds.ObjectSet.ObjectSetIterator
findPath(int, int, Collection<? extends Point2<?>>, Collection<? extends Point2<?>>, Point2<?>, Collection<? extends Point2<?>>) - Method in class com.github.tommyettinger.gand.GradientGrid: Scans the dungeon using GradientGrid.scan or GradientGrid.partialScan with the listed goals and start point, and returns a deque of P positions (using the current measurement) needed to get closer to the closest reachable goal.
findPath(int, Collection<? extends Point2<?>>, Collection<? extends Point2<?>>, Point2<?>, Collection<? extends Point2<?>>) - Method in class com.github.tommyettinger.gand.GradientGrid: Scans the dungeon using GradientGrid.scan with the listed goals and start point, and returns a deque of P positions (using the current measurement) needed to get closer to the closest reachable goal.
findPath(ObjectDeque, int, int, Collection<? extends Point2<?>>, Collection<? extends Point2<?>>, Point2<?>, Collection<? extends Point2<?>>) - Method in class com.github.tommyettinger.gand.GradientGrid: Scans the dungeon using GradientGrid.scan or GradientGrid.partialScan with the listed goals and start point, and returns a deque of P positions (using the current measurement) needed to get closer to the closest reachable goal.
findPathPreScanned(Point2<?>) - Method in class com.github.tommyettinger.gand.GradientGrid: When you can control how often the (relatively time-intensive) scan() method is called, but may need simple paths very frequently (such as for a path that follows the mouse), you can use this method to reduce the amount of work needed to find paths.
findPathPreScanned(ObjectDeque, Point2<?>) - Method in class com.github.tommyettinger.gand.GradientGrid: When you can control how often the (relatively time-intensive) scan() method is called, but may need simple paths very frequently (such as for a path that follows the mouse), you can use this method to reduce the amount of work needed to find paths.
findShortestPath(V, V) - Method in class com.github.tommyettinger.gand.algorithms.Algorithms: Find a shortest path from the start vertex to the target vertex, using Dijkstra's algorithm implemented with a priority queue.
findShortestPath(V, V, Heuristic<V>) - Method in class com.github.tommyettinger.gand.algorithms.Algorithms: Find a shortest path from the start vertex to the target vertex, using the A* search algorithm with the provided heuristic, and implemented with a priority queue.
findShortestPath(V, V, Heuristic<V>, SearchProcessor<V>) - Method in class com.github.tommyettinger.gand.algorithms.Algorithms: Find a shortest path from the start vertex to the target vertex, using the A* search algorithm with the provided heuristic, and implemented with a priority queue.
findShortestPath(V, V, SearchProcessor<V>) - Method in class com.github.tommyettinger.gand.algorithms.Algorithms: Find a shortest path from the start vertex to the target vertex, using Dijkstra's algorithm implemented with a priority queue.
finish() - Method in class com.github.tommyettinger.gand.algorithms.Algorithm
first() - Method in interface com.github.tommyettinger.gand.ds.IntCollection: Attempts to get the first item in this PrimitiveCollection, where "first" is only defined meaningfully if this type is ordered.
first() - Method in class com.github.tommyettinger.gand.ds.IntDeque: Returns the first (head) item in the queue (without removing it).
first() - Method in class com.github.tommyettinger.gand.ds.IntList: Returns the first item.
first() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Returns the first (head) item in the queue (without removing it).
first() - Method in class com.github.tommyettinger.gand.ds.ObjectOrderedSet
first() - Method in class com.github.tommyettinger.gand.ds.ObjectSet
Float2DirectedGraph - Class in com.github.tommyettinger.gand
Float2DirectedGraph() - Constructor for class com.github.tommyettinger.gand.Float2DirectedGraph
Float2DirectedGraph(boolean[][], float) - Constructor for class com.github.tommyettinger.gand.Float2DirectedGraph: Given a 2D boolean array, adds a vertex where a cell in validGrid is true, or ignores it otherwise.
Float2DirectedGraph(char[][], char, float) - Constructor for class com.github.tommyettinger.gand.Float2DirectedGraph: Given a 2D char array, adds a vertex where a cell in validGrid is equal to validChar, or ignores it otherwise.
Float2DirectedGraph(float[][], float, float, float) - Constructor for class com.github.tommyettinger.gand.Float2DirectedGraph: Given a 2D float array, adds a vertex where a cell in validGrid has a value between minimumThreshold and maximumThreshold, both inclusive, or ignores it otherwise.
Float2DirectedGraph(Graph<PointF2>) - Constructor for class com.github.tommyettinger.gand.Float2DirectedGraph
Float2DirectedGraph(Collection<PointF2>) - Constructor for class com.github.tommyettinger.gand.Float2DirectedGraph
Float2DirectedGraph(Collection<PointF2>, Collection<Edge<PointF2>>, float) - Constructor for class com.github.tommyettinger.gand.Float2DirectedGraph
Float2UndirectedGraph - Class in com.github.tommyettinger.gand
Float2UndirectedGraph() - Constructor for class com.github.tommyettinger.gand.Float2UndirectedGraph
Float2UndirectedGraph(boolean[][], float) - Constructor for class com.github.tommyettinger.gand.Float2UndirectedGraph: Given a 2D boolean array, adds a vertex where a cell in validGrid is true, or ignores it otherwise.
Float2UndirectedGraph(boolean[][], float, Heuristic<PointF2>, boolean) - Constructor for class com.github.tommyettinger.gand.Float2UndirectedGraph: Given a 2D boolean array, adds a vertex where a cell in validGrid is true, or ignores it otherwise.
Float2UndirectedGraph(char[][], char, float) - Constructor for class com.github.tommyettinger.gand.Float2UndirectedGraph: Given a 2D char array, adds a vertex where a cell in validGrid is equal to validChar, or ignores it otherwise.
Float2UndirectedGraph(char[][], char, float, Heuristic<PointF2>, boolean) - Constructor for class com.github.tommyettinger.gand.Float2UndirectedGraph: Given a 2D char array, adds a vertex where a cell in validGrid is equal to validChar, or ignores it otherwise.
Float2UndirectedGraph(float[][], float, float, float) - Constructor for class com.github.tommyettinger.gand.Float2UndirectedGraph: Given a 2D float array, adds a vertex where a cell in validGrid has a value between minimumThreshold and maximumThreshold, both inclusive, or ignores it otherwise.
Float2UndirectedGraph(float[][], float, float, float, Heuristic<PointF2>, boolean) - Constructor for class com.github.tommyettinger.gand.Float2UndirectedGraph: Given a 2D float array, adds a vertex where a cell in validGrid has a value between minimumThreshold and maximumThreshold, both inclusive, or ignores it otherwise.
Float2UndirectedGraph(Graph<PointF2>) - Constructor for class com.github.tommyettinger.gand.Float2UndirectedGraph
Float2UndirectedGraph(Collection<PointF2>) - Constructor for class com.github.tommyettinger.gand.Float2UndirectedGraph
Float2UndirectedGraph(Collection<PointF2>, Collection<Edge<PointF2>>, float) - Constructor for class com.github.tommyettinger.gand.Float2UndirectedGraph
Float3DirectedGraph - Class in com.github.tommyettinger.gand
Float3DirectedGraph() - Constructor for class com.github.tommyettinger.gand.Float3DirectedGraph
Float3DirectedGraph(boolean[][][], float) - Constructor for class com.github.tommyettinger.gand.Float3DirectedGraph: Given a 3D boolean array, adds a vertex where a cell in validGrid is true, or ignores it otherwise.
Float3DirectedGraph(char[][][], char, float) - Constructor for class com.github.tommyettinger.gand.Float3DirectedGraph: Given a 3D char array, adds a vertex where a cell in validGrid is equal to validChar, or ignores it otherwise.
Float3DirectedGraph(float[][][], float, float, float) - Constructor for class com.github.tommyettinger.gand.Float3DirectedGraph: Given a 3D float array, adds a vertex where a cell in validGrid has a value between minimumThreshold and maximumThreshold, both inclusive, or ignores it otherwise.
Float3DirectedGraph(Graph<PointF3>) - Constructor for class com.github.tommyettinger.gand.Float3DirectedGraph
Float3DirectedGraph(Collection<PointF3>) - Constructor for class com.github.tommyettinger.gand.Float3DirectedGraph
Float3DirectedGraph(Collection<PointF3>, Collection<Edge<PointF3>>, float) - Constructor for class com.github.tommyettinger.gand.Float3DirectedGraph
Float3UndirectedGraph - Class in com.github.tommyettinger.gand
Float3UndirectedGraph() - Constructor for class com.github.tommyettinger.gand.Float3UndirectedGraph
Float3UndirectedGraph(boolean[][][], float) - Constructor for class com.github.tommyettinger.gand.Float3UndirectedGraph: Given a 3D boolean array, adds a vertex where a cell in validGrid is true, or ignores it otherwise.
Float3UndirectedGraph(char[][][], char, float) - Constructor for class com.github.tommyettinger.gand.Float3UndirectedGraph: Given a 3D char array, adds a vertex where a cell in validGrid is equal to validChar, or ignores it otherwise.
Float3UndirectedGraph(float[][][], float, float, float) - Constructor for class com.github.tommyettinger.gand.Float3UndirectedGraph: Given a 3D float array, adds a vertex where a cell in validGrid has a value between minimumThreshold and maximumThreshold, both inclusive, or ignores it otherwise.
Float3UndirectedGraph(Graph<PointF3>) - Constructor for class com.github.tommyettinger.gand.Float3UndirectedGraph
Float3UndirectedGraph(Collection<PointF3>) - Constructor for class com.github.tommyettinger.gand.Float3UndirectedGraph
Float3UndirectedGraph(Collection<PointF3>, Collection<Edge<PointF3>>, float) - Constructor for class com.github.tommyettinger.gand.Float3UndirectedGraph
FLOOR - Static variable in class com.github.tommyettinger.gand.GradientGrid: Floor cells, which include any walkable cell, are marked with a high number equal to 999200f .
FlowRandom - Class in com.github.tommyettinger.gand.utils: A drop-in replacement for Random that adds few new APIs, but is faster, has better statistical quality, and has a guaranteed longer minimum period (also called cycle length).
FlowRandom() - Constructor for class com.github.tommyettinger.gand.utils.FlowRandom: Creates a new FlowRandom with a random state.
FlowRandom(long) - Constructor for class com.github.tommyettinger.gand.utils.FlowRandom: Creates a new FlowRandom with the given seed; all long values are permitted.
FlowRandom(long, long) - Constructor for class com.github.tommyettinger.gand.utils.FlowRandom: Creates a new FlowRandom with the given two states; all long values are permitted for stateA and for stateB.
forEach(IntConsumer) - Method in interface com.github.tommyettinger.gand.ds.IntCollection: Performs the given action for each element of the IntCollection until all elements have been processed or the action throws an exception.
fresh - Variable in class com.github.tommyettinger.gand.GradientGrid: Working data used during scanning, this tracks the perimeter of the scanned area so far.
frustration - Variable in class com.github.tommyettinger.gand.GradientGrid

G

get(int) - Method in class com.github.tommyettinger.gand.ds.IntDeque: Retrieves the value in queue without removing it.
get(int) - Method in class com.github.tommyettinger.gand.ds.IntList
get(int) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Retrieves the value in queue without removing it.
get(T) - Method in class com.github.tommyettinger.gand.ds.ObjectSet
getA() - Method in class com.github.tommyettinger.gand.Connection
getA() - Method in class com.github.tommyettinger.gand.Edge
getAt(int) - Method in class com.github.tommyettinger.gand.ds.ObjectOrderedSet: Gets the T item at the given index in the insertion order.
getB() - Method in class com.github.tommyettinger.gand.Connection
getB() - Method in class com.github.tommyettinger.gand.Edge
getBlockingRequirement() - Method in class com.github.tommyettinger.gand.GradientGrid: If you want obstacles present in orthogonal cells to prevent pathfinding along the diagonal between them, this can be used to make thin diagonal walls non-viable to move through, or even to prevent diagonal movement if any one obstacle is orthogonally adjacent to both the start and target cell of a diagonal move.
getCardinalDirection(int, int) - Static method in enum class com.github.tommyettinger.gand.utils.Direction: Returns the direction that most closely matches the input.
getComponents() - Method in class com.github.tommyettinger.gand.Graph: Gets a new ArrayList of Graph items (of the same class as this Graph), where each sub-graph only has connections to its own vertices.
getConnection() - Method in class com.github.tommyettinger.gand.Node
getConnections() - Method in class com.github.tommyettinger.gand.Internals
getConnections() - Method in class com.github.tommyettinger.gand.Node
getDefaultEdgeWeight() - Method in class com.github.tommyettinger.gand.Graph: Get the current default edge weight.
getDefaultLoadFactor() - Static method in class com.github.tommyettinger.gand.ds.Utilities: Gets the default load factor, meant to be used when no load factor is specified during the construction of a data structure such as a map or set.
getDefaultValue() - Method in class com.github.tommyettinger.gand.ds.IntDeque
getDefaultValue() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque
getDegree(V) - Method in class com.github.tommyettinger.gand.UndirectedGraph
getDirection(float, float) - Static method in enum class com.github.tommyettinger.gand.utils.Direction: Returns the direction that most closely matches the input.
getDistance() - Method in class com.github.tommyettinger.gand.Node
getEdge(V, V) - Method in class com.github.tommyettinger.gand.Graph: Retrieve the edge which is from v to w.
getEdgeCount() - Method in class com.github.tommyettinger.gand.Graph: Get the number of edges in the graph.
getEdges() - Method in class com.github.tommyettinger.gand.Graph: Get a collection containing all the edges in the graph.
getEdges(V) - Method in class com.github.tommyettinger.gand.Graph: Get a collection containing all the edges which have v as a tail.
getEstimate() - Method in class com.github.tommyettinger.gand.Node
getEstimate(V, V) - Method in interface com.github.tommyettinger.gand.utils.Heuristic
getFirst() - Method in class com.github.tommyettinger.gand.ds.IntDeque: Retrieves, but does not remove, the first element of this deque.
getFirst() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Retrieves, but does not remove, the first element of this deque.
getHeight() - Method in class com.github.tommyettinger.gand.GradientGrid: The y-size of the map.
getInDegree() - Method in class com.github.tommyettinger.gand.Node
getInDegree(V) - Method in class com.github.tommyettinger.gand.DirectedGraph
getIndex() - Method in class com.github.tommyettinger.gand.Node
getInEdges() - Method in class com.github.tommyettinger.gand.Node
getInEdges(V) - Method in class com.github.tommyettinger.gand.DirectedGraph: Get a collection containing all the edges which have v as a head.
getLast() - Method in class com.github.tommyettinger.gand.ds.IntDeque: Retrieves, but does not remove, the last element of this deque.
getLast() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Retrieves, but does not remove, the last element of this deque.
getLastPath() - Method in class com.github.tommyettinger.gand.TwistedLineI2: Gets the last path this found, which may be empty.
getLastPath() - Method in class com.github.tommyettinger.gand.TwistedLineI3: Gets the last path this found, which may be empty.
getLastRunID() - Method in class com.github.tommyettinger.gand.Node
getLength() - Method in class com.github.tommyettinger.gand.Path
getLoadFactor() - Method in class com.github.tommyettinger.gand.ds.ObjectSet
getMappedCount() - Method in class com.github.tommyettinger.gand.GradientGrid
getMaxX() - Method in class com.github.tommyettinger.gand.Int2DirectedGraph
getMaxX() - Method in class com.github.tommyettinger.gand.Int2UndirectedGraph
getMaxX() - Method in class com.github.tommyettinger.gand.Int3DirectedGraph
getMaxX() - Method in class com.github.tommyettinger.gand.Int3UndirectedGraph
getMaxY() - Method in class com.github.tommyettinger.gand.Int2DirectedGraph
getMaxY() - Method in class com.github.tommyettinger.gand.Int2UndirectedGraph
getMaxY() - Method in class com.github.tommyettinger.gand.Int3DirectedGraph
getMaxY() - Method in class com.github.tommyettinger.gand.Int3UndirectedGraph
getMaxZ() - Method in class com.github.tommyettinger.gand.Int3DirectedGraph
getMaxZ() - Method in class com.github.tommyettinger.gand.Int3UndirectedGraph
getMeasurement() - Method in class com.github.tommyettinger.gand.GradientGrid: This affects how distance is measured on diagonal directions vs.
getNode(V) - Method in class com.github.tommyettinger.gand.Internals
getNodeA() - Method in class com.github.tommyettinger.gand.Connection
getNodeB() - Method in class com.github.tommyettinger.gand.Connection
getNodes() - Method in class com.github.tommyettinger.gand.Internals
getObject() - Method in class com.github.tommyettinger.gand.Node
getOutDegree() - Method in class com.github.tommyettinger.gand.Node
getOutDegree(V) - Method in class com.github.tommyettinger.gand.DirectedGraph
getOutEdges() - Method in class com.github.tommyettinger.gand.Node
getPath() - Method in class com.github.tommyettinger.gand.algorithms.AStarSearch
getPrev() - Method in class com.github.tommyettinger.gand.Node
getRandom() - Method in class com.github.tommyettinger.gand.TwistedLineI2
getRandom() - Method in class com.github.tommyettinger.gand.TwistedLineI3
getSelectedState(int) - Method in class com.github.tommyettinger.gand.utils.Choo32Random: Gets the state determined by selection, as-is.
getSelectedState(int) - Method in class com.github.tommyettinger.gand.utils.Taxon32Random: Gets the state determined by selection, as-is.
getSpanningTree() - Method in class com.github.tommyettinger.gand.algorithms.MinimumWeightSpanningTree
getStateA() - Method in class com.github.tommyettinger.gand.utils.Choo32Random
getStateA() - Method in class com.github.tommyettinger.gand.utils.Taxon32Random
getStateB() - Method in class com.github.tommyettinger.gand.utils.Choo32Random
getStateB() - Method in class com.github.tommyettinger.gand.utils.Taxon32Random
getStateC() - Method in class com.github.tommyettinger.gand.utils.Choo32Random
getStateCount() - Method in class com.github.tommyettinger.gand.utils.Choo32Random: This generator has 4 int states, so this returns 4.
getStateD() - Method in class com.github.tommyettinger.gand.utils.Choo32Random
getStoredVertex(V) - Method in class com.github.tommyettinger.gand.Graph: Given a V vertex that may be equivalent (but not necessarily identical by reference) to a vertex in this Graph, this gets and returns a vertex that is considered equivalent if one is present, or returns null otherwise.
getVertices() - Method in class com.github.tommyettinger.gand.Graph: Get a collection containing all the vertices in the graph.
getWeight() - Method in class com.github.tommyettinger.gand.Connection
getWeight() - Method in class com.github.tommyettinger.gand.Edge
getWidth() - Method in class com.github.tommyettinger.gand.GradientGrid: The x-size of the map.
GOAL - Static variable in class com.github.tommyettinger.gand.GradientGrid: Goals are by default marked with 0f.
goals - Variable in class com.github.tommyettinger.gand.GradientGrid: Goals that pathfinding will seek out.
GradientGrid> - Class in com.github.tommyettinger.gand: A group of pathfinding algorithms that explore in all directions equally, and are commonly used when there is more than one valid goal, or when you want a gradient floodfill to mark each cell in an area with its distance from a goal.
GradientGrid() - Constructor for class com.github.tommyettinger.gand.GradientGrid: Construct a GradientGrid without a level to actually scan.
GradientGrid(char[][]) - Constructor for class com.github.tommyettinger.gand.GradientGrid: Constructor meant to take a char[][] in a simple, classic-roguelike-ish format, where '#' means a wall and anything else (often '.' or ' ') is a walkable tile.
GradientGrid(char[][], char) - Constructor for class com.github.tommyettinger.gand.GradientGrid: Constructor meant to take a char[][] in a simple, classic-roguelike-ish format, where alternateWall means a wall and anything else (often '.' or ' ') is a walkable tile.
GradientGrid(char[][], char, GridMetric) - Constructor for class com.github.tommyettinger.gand.GradientGrid: Constructor meant to take a char[][] in a simple, classic-roguelike-ish format, where alternateWall means a wall and anything else (often '.' or ' ') is a walkable tile.
GradientGrid(char[][], GridMetric) - Constructor for class com.github.tommyettinger.gand.GradientGrid: Constructor meant to take a char[][] in a simple, classic-roguelike-ish format, where '#' means a wall and anything else (often '.' or ' ') is a walkable tile.
GradientGrid(float[][]) - Constructor for class com.github.tommyettinger.gand.GradientGrid: Used to construct a GradientGrid from the output of another.
GradientGrid(float[][], GridMetric) - Constructor for class com.github.tommyettinger.gand.GradientGrid: Used to construct a GradientGrid from the output of another, specifying a distance calculation.
GradientGridI2 - Class in com.github.tommyettinger.gand: A group of pathfinding algorithms that explore in all directions equally, and are commonly used when there is more than one valid goal, or when you want a gradient floodfill to mark each cell in an area with its distance from a goal.
GradientGridI2() - Constructor for class com.github.tommyettinger.gand.GradientGridI2: Construct a GradientGrid without a level to actually scan.
GradientGridI2(char[][]) - Constructor for class com.github.tommyettinger.gand.GradientGridI2: Constructor meant to take a char[][] in a simple, classic-roguelike-ish format, where '#' means a wall and anything else (often '.' or ' ') is a walkable tile.
GradientGridI2(char[][], char) - Constructor for class com.github.tommyettinger.gand.GradientGridI2: Constructor meant to take a char[][] in a simple, classic-roguelike-ish format, where '#' means a wall and anything else (often '.' or ' ') is a walkable tile.
GradientGridI2(char[][], char, GridMetric) - Constructor for class com.github.tommyettinger.gand.GradientGridI2: Constructor meant to take a char[][] in a simple, classic-roguelike-ish format, where '#' means a wall and anything else (often '.' or ' ') is a walkable tile.
GradientGridI2(char[][], GridMetric) - Constructor for class com.github.tommyettinger.gand.GradientGridI2: Constructor meant to take a char[][] in a simple, classic-roguelike-ish format, where '#' means a wall and anything else (often '.' or ' ') is a walkable tile.
GradientGridI2(float[][]) - Constructor for class com.github.tommyettinger.gand.GradientGridI2: Used to construct a GradientGrid from the output of another.
GradientGridI2(float[][], GridMetric) - Constructor for class com.github.tommyettinger.gand.GradientGridI2: Used to construct a GradientGrid from the output of another, specifying a distance calculation.
gradientMap - Variable in class com.github.tommyettinger.gand.GradientGrid: The frequently-changing values that are often the point of using this class; goals will have a value of 0, and any cells that can have a character reach a goal in n steps will have a value of n.
graph - Variable in class com.github.tommyettinger.gand.algorithms.Algorithms
graph - Variable in class com.github.tommyettinger.gand.TwistedLineI2
graph - Variable in class com.github.tommyettinger.gand.TwistedLineI3
Graph<V> - Class in com.github.tommyettinger.gand
Graph() - Constructor for class com.github.tommyettinger.gand.Graph
Graph(Graph<V>) - Constructor for class com.github.tommyettinger.gand.Graph
Graph(Collection<V>) - Constructor for class com.github.tommyettinger.gand.Graph
Graph(Collection<V>, Collection<Edge<V>>, float) - Constructor for class com.github.tommyettinger.gand.Graph
GraphBuilder - Class in com.github.tommyettinger.gand
GridMetric - Enum Class in com.github.tommyettinger.gand.utils: A way of measuring what cells are adjacent and how much further any adjacent cells are from other adjacent cells.
GwtIncompatible - Annotation Interface in com.github.tommyettinger.gand.utils: An annotation for the GWT compiler that makes a piece of code ignored on GWT only.

H

hasEndpoint(V) - Method in class com.github.tommyettinger.gand.Edge
hasEndpoints(V, V) - Method in class com.github.tommyettinger.gand.Connection.DirectedConnection
hasEndpoints(V, V) - Method in class com.github.tommyettinger.gand.Connection.UndirectedConnection
hasEndpoints(V, V) - Method in class com.github.tommyettinger.gand.Edge
hash(PointF2) - Method in class com.github.tommyettinger.gand.Float2DirectedGraph: Get the hash used to calculate the index in the table at which the Node associated with v would be held.
hash(PointF2) - Method in class com.github.tommyettinger.gand.Float2UndirectedGraph: Get the hash used to calculate the index in the table at which the Node associated with v would be held.
hash(PointF3) - Method in class com.github.tommyettinger.gand.Float3DirectedGraph: Get the hash used to calculate the index in the table at which the Node associated with v would be held.
hash(PointF3) - Method in class com.github.tommyettinger.gand.Float3UndirectedGraph: Get the hash used to calculate the index in the table at which the Node associated with v would be held.
hash(PointI2) - Method in class com.github.tommyettinger.gand.Int2DirectedGraph: Get the hash used to calculate the index in the table at which the Node associated with v would be held.
hash(PointI2) - Method in class com.github.tommyettinger.gand.Int2UndirectedGraph: Get the hash used to calculate the index in the table at which the Node associated with v would be held.
hash(PointI3) - Method in class com.github.tommyettinger.gand.Int3DirectedGraph: Get the hash used to calculate the index in the table at which the Node associated with v would be held.
hash(PointI3) - Method in class com.github.tommyettinger.gand.Int3UndirectedGraph: Get the hash used to calculate the index in the table at which the Node associated with v would be held.
hash(V) - Method in class com.github.tommyettinger.gand.Graph: Get the hash used to calculate the index in the table at which the Node associated with v would be held.
hashCode() - Method in class com.github.tommyettinger.gand.Connection.DirectedConnection
hashCode() - Method in class com.github.tommyettinger.gand.Connection.UndirectedConnection
hashCode() - Method in interface com.github.tommyettinger.gand.ds.IntCollection
hashCode() - Method in class com.github.tommyettinger.gand.ds.IntDeque
hashCode() - Method in class com.github.tommyettinger.gand.ds.IntList
hashCode() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque
hashCode() - Method in class com.github.tommyettinger.gand.ds.ObjectSet
hashCode() - Method in class com.github.tommyettinger.gand.Graph
hashCode() - Method in class com.github.tommyettinger.gand.Node
hashCode() - Method in class com.github.tommyettinger.gand.Path
hashCode() - Method in class com.github.tommyettinger.gand.utils.FlowRandom
hashCode() - Method in class com.github.tommyettinger.gand.utils.Taxon32Random
hasNext - Variable in class com.github.tommyettinger.gand.ds.ObjectSet.ObjectSetIterator: This can be queried in place of calling ObjectSet.ObjectSetIterator.hasNext().
hasNext() - Method in class com.github.tommyettinger.gand.ds.IntDeque.IntDequeIterator: Returns true if the iteration has more elements.
hasNext() - Method in class com.github.tommyettinger.gand.ds.IntList.IntListIterator: Returns true if the iteration has more elements.
hasNext() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque.ObjectDequeIterator: Returns true if the iteration has more elements.
hasNext() - Method in class com.github.tommyettinger.gand.ds.ObjectSet.ObjectSetIterator
hasPrevious() - Method in class com.github.tommyettinger.gand.ds.IntDeque.IntDequeIterator: Returns true if this list iterator has more elements when traversing the list in the reverse direction.
hasPrevious() - Method in class com.github.tommyettinger.gand.ds.IntList.IntListIterator: Returns true if this list iterator has more elements when traversing the list in the reverse direction.
hasPrevious() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque.ObjectDequeIterator: Returns true if this list iterator has more elements when traversing the list in the reverse direction.
head - Variable in class com.github.tommyettinger.gand.ds.IntDeque: Index of first element.
head - Variable in class com.github.tommyettinger.gand.ds.ObjectDeque: Index of first element.
heapIndex - Variable in class com.github.tommyettinger.gand.Node
heapValue - Variable in class com.github.tommyettinger.gand.Node
height - Variable in class com.github.tommyettinger.gand.GradientGrid
heuristic(Direction) - Method in enum class com.github.tommyettinger.gand.utils.GridMetric
Heuristic<V> - Interface in com.github.tommyettinger.gand.utils: A function which estimates the distance of a shortest path between two vertices.

I

id - Variable in class com.github.tommyettinger.gand.algorithms.Algorithm
ignore() - Method in class com.github.tommyettinger.gand.algorithms.SearchStep: Ignore the current vertex, and do not check its neighbours in this step.
imul(int, int) - Static method in class com.github.tommyettinger.gand.utils.Compatibility: 32-bit signed integer multiplication that is correct on all platforms, including GWT.
index - Variable in class com.github.tommyettinger.gand.ds.IntDeque.IntDequeIterator
index - Variable in class com.github.tommyettinger.gand.ds.IntList.IntListIterator
index - Variable in class com.github.tommyettinger.gand.ds.ObjectDeque.ObjectDequeIterator
indexOf(int) - Method in class com.github.tommyettinger.gand.ds.IntDeque: Returns the index of first occurrence of value in the queue, or -1 if no such value exists.
indexOf(int) - Method in class com.github.tommyettinger.gand.ds.IntList: Returns the first index in this list that contains the specified value, or -1 if it is not present.
indexOf(Object) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Returns the index of the first occurrence of value in the queue, or -1 if no such value exists.
indexOf(Object, boolean) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Returns the index of first occurrence of value in the queue, or -1 if no such value exists.
inEdges - Variable in class com.github.tommyettinger.gand.Node
initEdges(int, int, float, Heuristic<PointF2>, boolean) - Method in class com.github.tommyettinger.gand.Float2UndirectedGraph: Attempts to add edges to every PointF2D (with integer coordinates) from 0,0 (inclusive) to xSize,ySize (exclusive).
initialize(char[][]) - Method in class com.github.tommyettinger.gand.GradientGrid: Used to initialize or re-initialize a GradientGrid that needs a new physicalMap because it either wasn't given one when it was constructed, or because the contents of the terrain have changed permanently (not if a creature moved; for that you pass the positions of creatures that block paths to scan() or findPath() ).
initialize(char[][], char) - Method in class com.github.tommyettinger.gand.GradientGrid: Used to initialize or re-initialize a GradientGrid that needs a new PhysicalMap because it either wasn't given one when it was constructed, or because the contents of the terrain have changed permanently (not if a creature moved; for that you pass the positions of creatures that block paths to scan() or findPath() ).
initialize(float[][]) - Method in class com.github.tommyettinger.gand.GradientGrid: Used to initialize or re-initialize a GradientGrid that needs a new physicalMap because it either wasn't given one when it was constructed, or because the contents of the terrain have changed permanently (not if a creature moved; for that you pass the positions of creatures that block paths to scan() or findPath() ).
initialized - Variable in class com.github.tommyettinger.gand.GradientGrid
initVertices(boolean[][]) - Method in class com.github.tommyettinger.gand.Float2UndirectedGraph: Adds a vertex for every x,y position in validGrid that is true.
initVertices(char[][], char) - Method in class com.github.tommyettinger.gand.Float2UndirectedGraph: Adds a vertex for every x,y position in validGrid that is equal to validChar.
initVertices(float[][], float, float) - Method in class com.github.tommyettinger.gand.Float2UndirectedGraph: Given a 2D float array, adds a vertex where a cell in validGrid has a value between minimumThreshold and maximumThreshold, both inclusive, or ignores it otherwise.
inputIndex - Variable in class com.github.tommyettinger.gand.smoothing.PathSmootherRequest
insert(int, int) - Method in class com.github.tommyettinger.gand.ds.IntDeque: This is an alias for IntDeque.add(int, int) to improve compatibility with primitive lists.
insert(int, int) - Method in class com.github.tommyettinger.gand.ds.IntList
insert(int, T) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: This is an alias for ObjectDeque.add(int, Object) to improve compatibility with primitive lists.
Int2DirectedGraph - Class in com.github.tommyettinger.gand
Int2DirectedGraph() - Constructor for class com.github.tommyettinger.gand.Int2DirectedGraph
Int2DirectedGraph(boolean[][], float) - Constructor for class com.github.tommyettinger.gand.Int2DirectedGraph: Given a 2D boolean array, adds a vertex where a cell in validGrid is true, or ignores it otherwise.
Int2DirectedGraph(char[][], char, float) - Constructor for class com.github.tommyettinger.gand.Int2DirectedGraph: Given a 2D char array, adds a vertex where a cell in validGrid is equal to validChar, or ignores it otherwise.
Int2DirectedGraph(float[][], float, float, float) - Constructor for class com.github.tommyettinger.gand.Int2DirectedGraph: Given a 2D float array, adds a vertex where a cell in validGrid has a value between minimumThreshold and maximumThreshold, both inclusive, or ignores it otherwise.
Int2DirectedGraph(Graph<PointI2>) - Constructor for class com.github.tommyettinger.gand.Int2DirectedGraph
Int2DirectedGraph(Collection<PointI2>) - Constructor for class com.github.tommyettinger.gand.Int2DirectedGraph
Int2DirectedGraph(Collection<PointI2>, Collection<Edge<PointI2>>, float) - Constructor for class com.github.tommyettinger.gand.Int2DirectedGraph
Int2UndirectedGraph - Class in com.github.tommyettinger.gand
Int2UndirectedGraph() - Constructor for class com.github.tommyettinger.gand.Int2UndirectedGraph
Int2UndirectedGraph(boolean[][], float) - Constructor for class com.github.tommyettinger.gand.Int2UndirectedGraph: Given a 2D boolean array, adds a vertex where a cell in validGrid is true, or ignores it otherwise.
Int2UndirectedGraph(char[][], char, float) - Constructor for class com.github.tommyettinger.gand.Int2UndirectedGraph: Given a 2D char array, adds a vertex where a cell in validGrid is equal to validChar, or ignores it otherwise.
Int2UndirectedGraph(float[][], float, float, float) - Constructor for class com.github.tommyettinger.gand.Int2UndirectedGraph: Given a 2D float array, adds a vertex where a cell in validGrid has a value between minimumThreshold and maximumThreshold, both inclusive, or ignores it otherwise.
Int2UndirectedGraph(Graph<PointI2>) - Constructor for class com.github.tommyettinger.gand.Int2UndirectedGraph
Int2UndirectedGraph(Collection<PointI2>) - Constructor for class com.github.tommyettinger.gand.Int2UndirectedGraph
Int2UndirectedGraph(Collection<PointI2>, Collection<Edge<PointI2>>, float) - Constructor for class com.github.tommyettinger.gand.Int2UndirectedGraph
Int3DirectedGraph - Class in com.github.tommyettinger.gand
Int3DirectedGraph() - Constructor for class com.github.tommyettinger.gand.Int3DirectedGraph
Int3DirectedGraph(boolean[][][], float) - Constructor for class com.github.tommyettinger.gand.Int3DirectedGraph: Given a 3D boolean array, adds a vertex where a cell in validGrid is true, or ignores it otherwise.
Int3DirectedGraph(char[][][], char, float) - Constructor for class com.github.tommyettinger.gand.Int3DirectedGraph: Given a 3D char array, adds a vertex where a cell in validGrid is equal to validChar, or ignores it otherwise.
Int3DirectedGraph(float[][][], float, float, float) - Constructor for class com.github.tommyettinger.gand.Int3DirectedGraph: Given a 3D float array, adds a vertex where a cell in validGrid has a value between minimumThreshold and maximumThreshold, both inclusive, or ignores it otherwise.
Int3DirectedGraph(Graph<PointI3>) - Constructor for class com.github.tommyettinger.gand.Int3DirectedGraph
Int3DirectedGraph(Collection<PointI3>) - Constructor for class com.github.tommyettinger.gand.Int3DirectedGraph
Int3DirectedGraph(Collection<PointI3>, Collection<Edge<PointI3>>, float) - Constructor for class com.github.tommyettinger.gand.Int3DirectedGraph
Int3UndirectedGraph - Class in com.github.tommyettinger.gand
Int3UndirectedGraph() - Constructor for class com.github.tommyettinger.gand.Int3UndirectedGraph
Int3UndirectedGraph(boolean[][][], float) - Constructor for class com.github.tommyettinger.gand.Int3UndirectedGraph: Given a 3D boolean array, adds a vertex where a cell in validGrid is true, or ignores it otherwise.
Int3UndirectedGraph(char[][][], char, float) - Constructor for class com.github.tommyettinger.gand.Int3UndirectedGraph: Given a 3D char array, adds a vertex where a cell in validGrid is equal to validChar, or ignores it otherwise.
Int3UndirectedGraph(float[][][], float, float, float) - Constructor for class com.github.tommyettinger.gand.Int3UndirectedGraph: Given a 3D float array, adds a vertex where a cell in validGrid has a value between minimumThreshold and maximumThreshold, both inclusive, or ignores it otherwise.
Int3UndirectedGraph(Graph<PointI3>) - Constructor for class com.github.tommyettinger.gand.Int3UndirectedGraph
Int3UndirectedGraph(Collection<PointI3>) - Constructor for class com.github.tommyettinger.gand.Int3UndirectedGraph
Int3UndirectedGraph(Collection<PointI3>, Collection<Edge<PointI3>>, float) - Constructor for class com.github.tommyettinger.gand.Int3UndirectedGraph
IntCollection - Interface in com.github.tommyettinger.gand.ds: Analogous to Collection but for primitive ints, this is built around the primitive-specialized iterator IntIterator instead of the generic Iterator.
IntComparator - Interface in com.github.tommyettinger.gand.utils: A type-specific Comparator; provides methods to compare two primitive types both as objects and as primitive types.
IntComparators - Class in com.github.tommyettinger.gand.utils: A class providing static methods and objects that do useful things with comparators.
IntComparators.NaturalImplicitComparator - Class in com.github.tommyettinger.gand.utils: A type-specific comparator mimicking the natural order.
IntComparators.OppositeComparator - Class in com.github.tommyettinger.gand.utils
IntComparators.OppositeImplicitComparator - Class in com.github.tommyettinger.gand.utils: A type-specific comparator mimicking the opposite of the natural order.
IntComparators.UnsignedComparator - Class in com.github.tommyettinger.gand.utils: A type-specific comparator that compares items in the natural order, but as if they are unsigned (so, all negative items are greater than any non-negative items).
IntComparators.UnsignedOppositeComparator - Class in com.github.tommyettinger.gand.utils: A type-specific comparator that compares items in the opposite of the natural order, but as if they are unsigned.
IntConsumer - Interface in com.github.tommyettinger.gand.utils: Represents an operation that accepts a single int-valued argument and returns no result.
IntDeque - Class in com.github.tommyettinger.gand.ds: A resizable, insertion-ordered double-ended queue of ints with efficient add and remove at the beginning and end.
IntDeque() - Constructor for class com.github.tommyettinger.gand.ds.IntDeque: Creates a new IntDeque which can hold 16 values without needing to resize backing array.
IntDeque(int) - Constructor for class com.github.tommyettinger.gand.ds.IntDeque: Creates a new IntDeque which can hold the specified number of values without needing to resize backing array.
IntDeque(int[]) - Constructor for class com.github.tommyettinger.gand.ds.IntDeque: Creates a new IntDeque using all of the contents of the given array.
IntDeque(int[], int, int) - Constructor for class com.github.tommyettinger.gand.ds.IntDeque: Creates a new IntDeque using count items from a, starting at offset.
IntDeque(IntCollection) - Constructor for class com.github.tommyettinger.gand.ds.IntDeque: Creates a new IntDeque using all of the contents of the given IntCollection.
IntDeque(IntDeque) - Constructor for class com.github.tommyettinger.gand.ds.IntDeque: Copies the given IntDeque exactly into this one.
IntDeque.IntDequeIterator - Class in com.github.tommyettinger.gand.ds: A IntIterator, plus similar methods to a ListIterator, over the elements of an IntDeque.
IntDequeIterator(IntDeque) - Constructor for class com.github.tommyettinger.gand.ds.IntDeque.IntDequeIterator
IntDequeIterator(IntDeque, boolean) - Constructor for class com.github.tommyettinger.gand.ds.IntDeque.IntDequeIterator
IntDequeIterator(IntDeque, int, boolean) - Constructor for class com.github.tommyettinger.gand.ds.IntDeque.IntDequeIterator
internals - Variable in class com.github.tommyettinger.gand.Graph
internals() - Method in class com.github.tommyettinger.gand.Graph
Internals<V> - Class in com.github.tommyettinger.gand: Used by Graph internally; not meant for external usage.
IntIntIntPredicate - Interface in com.github.tommyettinger.gand.utils: Represents an operation that accepts three int arguments and returns a boolean result.
IntIntPredicate - Interface in com.github.tommyettinger.gand.utils: Represents an operation that accepts two int arguments and returns a boolean result.
IntIterator - Interface in com.github.tommyettinger.gand.utils: An Iterator specialized for int values.
IntList - Class in com.github.tommyettinger.gand.ds: A resizable, insertion-ordered int list.
IntList() - Constructor for class com.github.tommyettinger.gand.ds.IntList: Creates an ordered list with a capacity of 10.
IntList(int) - Constructor for class com.github.tommyettinger.gand.ds.IntList: Creates an ordered list with the specified capacity.
IntList(int[]) - Constructor for class com.github.tommyettinger.gand.ds.IntList: Creates a new list containing the elements in the specified array.
IntList(int[], int, int) - Constructor for class com.github.tommyettinger.gand.ds.IntList: Creates a new list containing the elements in the specified array.
IntList(IntCollection) - Constructor for class com.github.tommyettinger.gand.ds.IntList: Creates a new list containing the items in the specified IntCollection.
IntList(IntList) - Constructor for class com.github.tommyettinger.gand.ds.IntList: Creates a new list containing the elements in the given list.
IntList.IntListIterator - Class in com.github.tommyettinger.gand.ds: A IntIterator, plus ListIterator methods, over the elements of a IntList.
IntListIterator(IntList) - Constructor for class com.github.tommyettinger.gand.ds.IntList.IntListIterator
IntListIterator(IntList, int) - Constructor for class com.github.tommyettinger.gand.ds.IntList.IntListIterator
IntPredicate - Interface in com.github.tommyettinger.gand.utils: Represents an operation that accepts one int argument and returns a boolean result.
isCardinal() - Method in enum class com.github.tommyettinger.gand.utils.Direction
isConnected() - Method in class com.github.tommyettinger.gand.Graph
isConnected(V, V) - Method in class com.github.tommyettinger.gand.algorithms.Algorithms: Checks whether there exists a path from the start vertex to target vertex, using Dijkstra's algorithm implemented with a priority queue.
isDiagonal() - Method in enum class com.github.tommyettinger.gand.utils.Direction
isDirected() - Method in class com.github.tommyettinger.gand.Graph: Check if the graph is directed, that is whether the edges form an ordered pair or a set.
isDirected() - Method in class com.github.tommyettinger.gand.UndirectedGraph
isEmpty() - Method in interface com.github.tommyettinger.gand.ds.IntCollection
isEmpty() - Method in class com.github.tommyettinger.gand.ds.IntDeque: Returns true if the queue is empty.
isEmpty() - Method in class com.github.tommyettinger.gand.ds.IntList: Returns true if the list is empty.
isEmpty() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Returns true if the queue is empty.
isEmpty() - Method in class com.github.tommyettinger.gand.ds.ObjectSet: Returns true if the set is empty.
isFinished() - Method in class com.github.tommyettinger.gand.algorithms.Algorithm
isFinished() - Method in class com.github.tommyettinger.gand.algorithms.AStarSearch
isFinished() - Method in class com.github.tommyettinger.gand.algorithms.BreadthFirstSearch
isFinished() - Method in class com.github.tommyettinger.gand.algorithms.CycleDetector
isFinished() - Method in class com.github.tommyettinger.gand.algorithms.DepthFirstSearch
isFinished() - Method in class com.github.tommyettinger.gand.algorithms.MinimumWeightSpanningTree
isNew - Variable in class com.github.tommyettinger.gand.smoothing.PathSmootherRequest
isProcessed() - Method in class com.github.tommyettinger.gand.Node
isSeen() - Method in class com.github.tommyettinger.gand.Node
isWithin(int, int, int, int) - Static method in class com.github.tommyettinger.gand.GradientGrid
isWithin(Point2<?>, int, int) - Static method in class com.github.tommyettinger.gand.GradientGrid
items - Variable in class com.github.tommyettinger.gand.ds.IntList
items - Variable in class com.github.tommyettinger.gand.ds.ObjectOrderedSet
iterator() - Method in interface com.github.tommyettinger.gand.ds.IntCollection
iterator() - Method in class com.github.tommyettinger.gand.ds.IntDeque.IntDequeIterator: Returns an iterator over elements of type int.
iterator() - Method in class com.github.tommyettinger.gand.ds.IntDeque: Returns an iterator for the items in the deque.
iterator() - Method in class com.github.tommyettinger.gand.ds.IntList.IntListIterator: Returns an iterator over elements of type int.
iterator() - Method in class com.github.tommyettinger.gand.ds.IntList: Returns a Java 8 primitive iterator over the int items in this IntList.
iterator() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Returns an iterator for the items in the deque.
iterator() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque.ObjectDequeIterator: Returns an iterator over elements of type T.
iterator() - Method in class com.github.tommyettinger.gand.ds.ObjectOrderedSet: Iterates through items in the same order as ObjectOrderedSet.order().
iterator() - Method in class com.github.tommyettinger.gand.ds.ObjectSet: Returns an iterator for the keys in the set.
iterator() - Method in class com.github.tommyettinger.gand.ds.ObjectSet.ObjectSetIterator
iterator1 - Variable in class com.github.tommyettinger.gand.ds.IntDeque
iterator1 - Variable in class com.github.tommyettinger.gand.ds.IntList
iterator1 - Variable in class com.github.tommyettinger.gand.ds.ObjectDeque
iterator1 - Variable in class com.github.tommyettinger.gand.ds.ObjectSet
iterator2 - Variable in class com.github.tommyettinger.gand.ds.IntDeque
iterator2 - Variable in class com.github.tommyettinger.gand.ds.IntList
iterator2 - Variable in class com.github.tommyettinger.gand.ds.ObjectDeque
iterator2 - Variable in class com.github.tommyettinger.gand.ds.ObjectSet

J

JsonRegistration - Class in com.github.tommyettinger.gand.utils: Utility methods to register common Vector/GridPoint types with an instance of libGDX Json.

K

keyTable - Variable in class com.github.tommyettinger.gand.ds.ObjectSet

L

largestComponent() - Method in class com.github.tommyettinger.gand.Graph: Gets the sub-graph that is the largest Graph (of the same class as this Graph) within this one, that only has connections to its own vertices.
last() - Method in class com.github.tommyettinger.gand.ds.IntDeque: Returns the last (tail) item in the queue (without removing it).
last() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Returns the last (tail) item in the queue (without removing it).
lastIndexOf(int) - Method in class com.github.tommyettinger.gand.ds.IntDeque: Returns the index of last occurrence of value in the queue, or -1 if no such value exists.
lastIndexOf(int) - Method in class com.github.tommyettinger.gand.ds.IntList: Returns the last index in this list that contains the specified value, or -1 if it is not present.
lastIndexOf(Object) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Returns the index of the last occurrence of value in the queue, or -1 if no such value exists.
lastIndexOf(Object, boolean) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Returns the index of last occurrence of value in the queue, or -1 if no such value exists.
lastPath - Variable in class com.github.tommyettinger.gand.TwistedLineI2
lastPath - Variable in class com.github.tommyettinger.gand.TwistedLineI3
lastRunID() - Method in class com.github.tommyettinger.gand.algorithms.Algorithms
latest - Variable in class com.github.tommyettinger.gand.ds.IntDeque.IntDequeIterator
latest - Variable in class com.github.tommyettinger.gand.ds.IntList.IntListIterator
latest - Variable in class com.github.tommyettinger.gand.ds.ObjectDeque.ObjectDequeIterator
LEFT - Enum constant in enum class com.github.tommyettinger.gand.utils.Direction
line(PointI2, PointI2) - Method in class com.github.tommyettinger.gand.TwistedLineI2
line(PointI3, PointI3) - Method in class com.github.tommyettinger.gand.TwistedLineI3
line(Collection<PointI2>, PointI2, PointI2) - Method in class com.github.tommyettinger.gand.TwistedLineI2: Finds a twisted line from start to end and appends the points of that line into path.
line(Collection<PointI3>, PointI3, PointI3) - Method in class com.github.tommyettinger.gand.TwistedLineI3: Finds a twisted line from start to end and appends the points of that line into path.
list - Variable in class com.github.tommyettinger.gand.ds.IntList.IntListIterator
loadFactor - Variable in class com.github.tommyettinger.gand.ds.ObjectSet: Between 0f (exclusive) and 1f (inclusive, if you're careful), this determines how full the backing table can get before this increases its size.
locateKey(Object) - Method in class com.github.tommyettinger.gand.ds.ObjectSet: Returns the index of the key if already present, else ~index for the next empty index.
lowestOneBit(int) - Static method in class com.github.tommyettinger.gand.utils.Compatibility: Returns an int value with at most a single one-bit, in the position of the lowest-order ("rightmost") one-bit in the specified int value.
lowestOneBit(long) - Static method in class com.github.tommyettinger.gand.utils.Compatibility: Returns an long value with at most a single one-bit, in the position of the lowest-order ("rightmost") one-bit in the specified long value.

M

MANHATTAN - Enum constant in enum class com.github.tommyettinger.gand.utils.GridMetric: The distance it takes when only the four primary directions can be moved in.
mapHash - Variable in class com.github.tommyettinger.gand.Node
mappedCount - Variable in class com.github.tommyettinger.gand.GradientGrid
mask - Variable in class com.github.tommyettinger.gand.ds.ObjectSet: A bitmask used to confine hashcodes to the size of the table.
MinimumWeightSpanningTree<V> - Class in com.github.tommyettinger.gand.algorithms
MinimumWeightSpanningTree(int, UndirectedGraph<V>, boolean) - Constructor for class com.github.tommyettinger.gand.algorithms.MinimumWeightSpanningTree
minus(int) - Method in class com.github.tommyettinger.gand.ds.IntList: Takes each item in this IntList and subtracts value, stores it in this and returns it.
minus(int, int) - Method in class com.github.tommyettinger.gand.ds.IntList

N

NATURAL_COMPARATOR - Static variable in class com.github.tommyettinger.gand.utils.IntComparators
NaturalImplicitComparator() - Constructor for class com.github.tommyettinger.gand.utils.IntComparators.NaturalImplicitComparator
neighbors - Variable in class com.github.tommyettinger.gand.Node
neighbors() - Method in class com.github.tommyettinger.gand.algorithms.SearchStep: Gets an ArrayList of every Connection between this processed V vertex and its neighbors.
neverIdentical - Static variable in class com.github.tommyettinger.gand.ds.Utilities: A placeholder Object that should never be reference-equivalent to any Object used as a key or value.
newAstarSeach(V, V, Heuristic<V>, SearchProcessor<V>) - Method in class com.github.tommyettinger.gand.algorithms.Algorithms: Find a shortest path from the start vertex to the target vertex, using the A* search algorithm with the provided heuristic, and implemented with a priority queue.
next() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque.ObjectDequeIterator: Returns the next T element in the iteration.
next() - Method in class com.github.tommyettinger.gand.ds.ObjectOrderedSet.ObjectOrderedSetIterator
next() - Method in class com.github.tommyettinger.gand.ds.ObjectSet.ObjectSetIterator
next() - Method in interface com.github.tommyettinger.gand.utils.IntIterator
next(int) - Method in class com.github.tommyettinger.gand.utils.Choo32Random
next(int) - Method in class com.github.tommyettinger.gand.utils.FlowRandom
next(int) - Method in class com.github.tommyettinger.gand.utils.Taxon32Random
nextBoolean() - Method in class com.github.tommyettinger.gand.utils.Choo32Random
nextBoolean() - Method in class com.github.tommyettinger.gand.utils.FlowRandom
nextBoolean() - Method in class com.github.tommyettinger.gand.utils.Taxon32Random
nextBytes(byte[]) - Method in class com.github.tommyettinger.gand.utils.Choo32Random
nextBytes(byte[]) - Method in class com.github.tommyettinger.gand.utils.FlowRandom
nextBytes(byte[]) - Method in class com.github.tommyettinger.gand.utils.Taxon32Random
nextDouble() - Method in class com.github.tommyettinger.gand.utils.Choo32Random
nextDouble() - Method in class com.github.tommyettinger.gand.utils.FlowRandom
nextDouble() - Method in class com.github.tommyettinger.gand.utils.Taxon32Random
nextFloat() - Method in class com.github.tommyettinger.gand.utils.Choo32Random
nextFloat() - Method in class com.github.tommyettinger.gand.utils.FlowRandom
nextFloat() - Method in class com.github.tommyettinger.gand.utils.Taxon32Random
nextGaussian() - Method in class com.github.tommyettinger.gand.utils.Choo32Random
nextGaussian() - Method in class com.github.tommyettinger.gand.utils.FlowRandom
nextGaussian() - Method in class com.github.tommyettinger.gand.utils.Taxon32Random
nextInclusiveFloat() - Method in class com.github.tommyettinger.gand.utils.Choo32Random
nextIndex - Variable in class com.github.tommyettinger.gand.ds.ObjectSet.ObjectSetIterator: The next index in the set's key table to go to and return from ObjectSet.ObjectSetIterator.next().
nextIndex() - Method in class com.github.tommyettinger.gand.ds.IntDeque.IntDequeIterator: Returns the index of the element that would be returned by a subsequent call to IntDeque.IntDequeIterator.nextInt().
nextIndex() - Method in class com.github.tommyettinger.gand.ds.IntList.IntListIterator: Returns the index of the element that would be returned by a subsequent call to IntList.IntListIterator.nextInt().
nextIndex() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque.ObjectDequeIterator: Returns the index of the element that would be returned by a subsequent call to ObjectDeque.ObjectDequeIterator.next().
nextInt() - Method in class com.github.tommyettinger.gand.ds.IntDeque.IntDequeIterator: Returns the next int element in the iteration.
nextInt() - Method in class com.github.tommyettinger.gand.ds.IntList.IntListIterator: Returns the next int element in the iteration.
nextInt() - Method in class com.github.tommyettinger.gand.utils.Choo32Random
nextInt() - Method in class com.github.tommyettinger.gand.utils.FlowRandom
nextInt() - Method in interface com.github.tommyettinger.gand.utils.IntIterator: Returns the next int element in the iteration.
nextInt() - Method in class com.github.tommyettinger.gand.utils.Taxon32Random
nextInt(int) - Method in class com.github.tommyettinger.gand.utils.Choo32Random
nextInt(int) - Method in class com.github.tommyettinger.gand.utils.FlowRandom
nextInt(int) - Method in class com.github.tommyettinger.gand.utils.Taxon32Random
nextLong() - Method in class com.github.tommyettinger.gand.utils.Choo32Random
nextLong() - Method in class com.github.tommyettinger.gand.utils.FlowRandom
nextLong() - Method in class com.github.tommyettinger.gand.utils.Taxon32Random
nextLong(long, long) - Method in class com.github.tommyettinger.gand.utils.Choo32Random
nextLong(long, long) - Method in class com.github.tommyettinger.gand.utils.Taxon32Random
nextSignedInt(int) - Method in class com.github.tommyettinger.gand.utils.Choo32Random
nextSignedLong(long, long) - Method in class com.github.tommyettinger.gand.utils.Choo32Random
Node<V> - Class in com.github.tommyettinger.gand: A graph node that wraps a given type of position, V.
Node(V, boolean, int) - Constructor for class com.github.tommyettinger.gand.Node
NONE - Enum constant in enum class com.github.tommyettinger.gand.utils.Direction
notEmpty() - Method in interface com.github.tommyettinger.gand.ds.IntCollection
notEmpty() - Method in class com.github.tommyettinger.gand.ds.IntDeque: Returns true if the queue has one or more items.
notEmpty() - Method in class com.github.tommyettinger.gand.ds.IntList: Returns true if the list has one or more items, or false otherwise.
notEmpty() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Returns true if the queue has one or more items.
notEmpty() - Method in class com.github.tommyettinger.gand.ds.ObjectSet: Returns true if the set has one or more items.
numberOfComponents() - Method in class com.github.tommyettinger.gand.Graph

O

ObjectConsumer<T> - Interface in com.github.tommyettinger.gand.utils: Represents an operation that accepts a single T-valued argument and returns no result.
ObjectDeque<T> - Class in com.github.tommyettinger.gand.ds: A resizable, insertion-ordered double-ended queue of objects with efficient add and remove at the beginning and end.
ObjectDeque() - Constructor for class com.github.tommyettinger.gand.ds.ObjectDeque: Creates a new ObjectDeque which can hold 16 values without needing to resize its backing array.
ObjectDeque(int) - Constructor for class com.github.tommyettinger.gand.ds.ObjectDeque: Creates a new ObjectDeque which can hold the specified number of values without needing to resize its backing array.
ObjectDeque(ObjectDeque<? extends T>) - Constructor for class com.github.tommyettinger.gand.ds.ObjectDeque: Copies the given ObjectDeque exactly into this one.
ObjectDeque(Collection<? extends T>) - Constructor for class com.github.tommyettinger.gand.ds.ObjectDeque: Creates a new ObjectDeque using all the contents of the given Collection.
ObjectDeque(T[]) - Constructor for class com.github.tommyettinger.gand.ds.ObjectDeque: Creates a new ObjectDeque using all the contents of the given array.
ObjectDeque(T[], int, int) - Constructor for class com.github.tommyettinger.gand.ds.ObjectDeque: Creates a new ObjectDeque using count items from a, starting at offset.
ObjectDeque.ObjectDequeIterator<T> - Class in com.github.tommyettinger.gand.ds: An Iterator and ListIterator over the elements of an ObjectDeque, while also an Iterable.
ObjectDequeIterator(ObjectDeque<T>) - Constructor for class com.github.tommyettinger.gand.ds.ObjectDeque.ObjectDequeIterator
ObjectDequeIterator(ObjectDeque<T>, boolean) - Constructor for class com.github.tommyettinger.gand.ds.ObjectDeque.ObjectDequeIterator
ObjectDequeIterator(ObjectDeque<T>, int, boolean) - Constructor for class com.github.tommyettinger.gand.ds.ObjectDeque.ObjectDequeIterator
ObjectOrderedSet<T> - Class in com.github.tommyettinger.gand.ds: A ObjectSet that also stores keys in an ArrayList using the insertion order.
ObjectOrderedSet() - Constructor for class com.github.tommyettinger.gand.ds.ObjectOrderedSet
ObjectOrderedSet(int) - Constructor for class com.github.tommyettinger.gand.ds.ObjectOrderedSet
ObjectOrderedSet(int, float) - Constructor for class com.github.tommyettinger.gand.ds.ObjectOrderedSet
ObjectOrderedSet(ObjectOrderedSet<? extends T>) - Constructor for class com.github.tommyettinger.gand.ds.ObjectOrderedSet
ObjectOrderedSet(Collection<? extends T>) - Constructor for class com.github.tommyettinger.gand.ds.ObjectOrderedSet: Creates a new set that contains all distinct elements in coll.
ObjectOrderedSet(List<T>, int, int) - Constructor for class com.github.tommyettinger.gand.ds.ObjectOrderedSet: Creates a new set by copying count items from the given Ordered, starting at offset in that Ordered, into this.
ObjectOrderedSet(T[]) - Constructor for class com.github.tommyettinger.gand.ds.ObjectOrderedSet: Creates a new set that contains all distinct elements in items.
ObjectOrderedSet(T[], int, int) - Constructor for class com.github.tommyettinger.gand.ds.ObjectOrderedSet: Creates a new set using length items from the given array, starting at offset (inclusive).
ObjectOrderedSet.ObjectOrderedSetIterator<K> - Class in com.github.tommyettinger.gand.ds
ObjectOrderedSetIterator(ObjectOrderedSet<K>) - Constructor for class com.github.tommyettinger.gand.ds.ObjectOrderedSet.ObjectOrderedSetIterator
ObjectPredicate<T> - Interface in com.github.tommyettinger.gand.utils: Represents an operation that accepts a single T-valued argument and returns a boolean result.
ObjectSet<T> - Class in com.github.tommyettinger.gand.ds: An unordered set where the keys are objects.
ObjectSet() - Constructor for class com.github.tommyettinger.gand.ds.ObjectSet: Creates a new set with an initial capacity of 51 and a load factor of getDefaultLoadFactor().
ObjectSet(int) - Constructor for class com.github.tommyettinger.gand.ds.ObjectSet: Creates a new set with a load factor of getDefaultLoadFactor().
ObjectSet(int, float) - Constructor for class com.github.tommyettinger.gand.ds.ObjectSet: Creates a new set with the specified initial capacity and load factor.
ObjectSet(ObjectSet<? extends T>) - Constructor for class com.github.tommyettinger.gand.ds.ObjectSet: Creates a new set identical to the specified set.
ObjectSet(Collection<? extends T>) - Constructor for class com.github.tommyettinger.gand.ds.ObjectSet: Creates a new set that contains all distinct elements in coll.
ObjectSet(T[]) - Constructor for class com.github.tommyettinger.gand.ds.ObjectSet: Creates a new set containing all the items in the given array.
ObjectSet(T[], int, int) - Constructor for class com.github.tommyettinger.gand.ds.ObjectSet: Creates a new set using length items from the given array, starting at offset (inclusive).
ObjectSet.ObjectSetIterator<T> - Class in com.github.tommyettinger.gand.ds
ObjectSetIterator(ObjectSet<T>) - Constructor for class com.github.tommyettinger.gand.ds.ObjectSet.ObjectSetIterator
ObjectSort - Class in com.github.tommyettinger.gand.utils: An alternative to Arrays.sort(Object[], int, int, Comparator) or Sort for sorting an array with no allocation.
ObjectSort() - Constructor for class com.github.tommyettinger.gand.utils.ObjectSort
obtainEdge() - Method in class com.github.tommyettinger.gand.DirectedGraph
obtainEdge() - Method in class com.github.tommyettinger.gand.UndirectedGraph
offer(int) - Method in class com.github.tommyettinger.gand.ds.IntDeque: Inserts the specified element into the queue represented by this deque (in other words, at the tail of this deque) if it is possible to do so immediately without violating capacity restrictions, returning true upon success and false if no space is currently available.
offer(T) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Inserts the specified element into the queue represented by this deque (in other words, at the tail of this deque) if it is possible to do so immediately without violating capacity restrictions, returning true upon success and false if no space is currently available.
offerFirst(int) - Method in class com.github.tommyettinger.gand.ds.IntDeque: Inserts the specified element at the front of this deque unless it would violate capacity restrictions.
offerFirst(T) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Inserts the specified element at the front of this deque unless it would violate capacity restrictions.
offerLast(int) - Method in class com.github.tommyettinger.gand.ds.IntDeque: Inserts the specified element at the end of this deque unless it would violate capacity restrictions.
offerLast(T) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Inserts the specified element at the end of this deque unless it would violate capacity restrictions.
OPPOSITE_COMPARATOR - Static variable in class com.github.tommyettinger.gand.utils.IntComparators
oppositeComparator(IntComparator) - Static method in class com.github.tommyettinger.gand.utils.IntComparators: Returns a comparator representing the opposite order of the given comparator.
OppositeComparator(IntComparator) - Constructor for class com.github.tommyettinger.gand.utils.IntComparators.OppositeComparator
OppositeImplicitComparator() - Constructor for class com.github.tommyettinger.gand.utils.IntComparators.OppositeImplicitComparator
order() - Method in class com.github.tommyettinger.gand.ds.ObjectOrderedSet: Gets the ArrayList of items in the order this class will iterate through them.
Ortho2DRaycastCollisionDetector> - Class in com.github.tommyettinger.gand.smoothing: A raycast collision detector used for path smoothing in 2D, with cells considered passable if a predicate returns true.
Ortho2DRaycastCollisionDetector(IntIntPredicate) - Constructor for class com.github.tommyettinger.gand.smoothing.Ortho2DRaycastCollisionDetector: Creates a Ortho2DRaycastCollisionDetector that uses the given predicate to determine if an x,y cell is passable.
Ortho3DRaycastCollisionDetector> - Class in com.github.tommyettinger.gand.smoothing: A raycast collision detector used for path smoothing in 3D, with cells considered passable if a predicate returns true.
Ortho3DRaycastCollisionDetector(IntIntIntPredicate) - Constructor for class com.github.tommyettinger.gand.smoothing.Ortho3DRaycastCollisionDetector: Creates a Ortho3DRaycastCollisionDetector that uses the given predicate to determine if an x,y,z cell is passable.
outEdges - Variable in class com.github.tommyettinger.gand.Node
outputIndex - Variable in class com.github.tommyettinger.gand.smoothing.PathSmootherRequest
OUTWARDS - Static variable in enum class com.github.tommyettinger.gand.utils.Direction: An array which holds all eight OUTWARDS directions.

P

partialScan(int) - Method in class com.github.tommyettinger.gand.GradientGrid: Recalculate the GradientGrid up to a limit and return it.
partialScan(int, Point2<?>, Iterable<? extends Point2<?>>, int) - Method in class com.github.tommyettinger.gand.GradientGrid: Recalculate the GradientGrid for a creature that is potentially larger than 1x1 cell and return it.
partialScan(int, Iterable<? extends Point2<?>>) - Method in class com.github.tommyettinger.gand.GradientGrid: Recalculate the GradientGrid up to a limit and return it.
partialScan(int, Iterable<? extends Point2<?>>, int) - Method in class com.github.tommyettinger.gand.GradientGrid: Recalculate the GradientGrid for a creature that is potentially larger than 1x1 cell and return it.
partialScan(Point2<?>, int, Iterable<? extends Point2<?>>) - Method in class com.github.tommyettinger.gand.GradientGrid: Recalculate the GradientGrid up to a limit and return it.
partialScan(Point2<?>, int, Iterable<? extends Point2<?>>, boolean) - Method in class com.github.tommyettinger.gand.GradientGrid: Recalculate the GradientGrid up to a limit and return it.
path - Variable in class com.github.tommyettinger.gand.GradientGrid: The latest path that was obtained by calling findPath().
path - Variable in class com.github.tommyettinger.gand.smoothing.PathSmootherRequest
Path<V> - Class in com.github.tommyettinger.gand
Path() - Constructor for class com.github.tommyettinger.gand.Path: Creates a new Path which can hold 16 values without needing to resize its backing array.
Path(int) - Constructor for class com.github.tommyettinger.gand.Path
Path(int, boolean) - Constructor for class com.github.tommyettinger.gand.Path
Path(ObjectDeque<? extends V>) - Constructor for class com.github.tommyettinger.gand.Path: Copies the given ObjectDeque exactly into a new Path.
Path(Path<? extends V>) - Constructor for class com.github.tommyettinger.gand.Path: Copies the given Path exactly into this one.
Path(Collection<? extends V>) - Constructor for class com.github.tommyettinger.gand.Path: Creates a new Path using all the contents of the given Collection.
Path(V[]) - Constructor for class com.github.tommyettinger.gand.Path: Creates a new Path using all the contents of the given array.
Path(V[], int, int) - Constructor for class com.github.tommyettinger.gand.Path: Creates a new Path using count items from a, starting at offset.
PathSmoother<V extends com.github.tommyettinger.crux.PointN<V>> - Class in com.github.tommyettinger.gand.smoothing: A PathSmoother takes a Path of PointN items and transforms it by linking directly the nodes that are in line of sight.
PathSmoother(RaycastCollisionDetector<V>) - Constructor for class com.github.tommyettinger.gand.smoothing.PathSmoother: Creates a PathSmoother using the given RaycastCollisionDetector
PathSmootherRequest<V extends com.github.tommyettinger.crux.PointN<V>> - Class in com.github.tommyettinger.gand.smoothing: A request for interruptible path smoothing.
PathSmootherRequest() - Constructor for class com.github.tommyettinger.gand.smoothing.PathSmootherRequest: Creates an empty PathSmootherRequest
peek() - Method in class com.github.tommyettinger.gand.ds.IntDeque: Retrieves, but does not remove, the head of the queue represented by this deque (in other words, the first element of this deque), or returns IntDeque.defaultValue if this deque is empty.
peek() - Method in class com.github.tommyettinger.gand.ds.IntList: Returns the last item.
peek() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Retrieves, but does not remove, the head of the queue represented by this deque (in other words, the first element of this deque), or returns defaultValue if this deque is empty.
peekFirst() - Method in class com.github.tommyettinger.gand.ds.IntDeque: Retrieves, but does not remove, the first element of this deque, or returns IntDeque.defaultValue if this deque is empty.
peekFirst() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Retrieves, but does not remove, the first element of this deque, or returns defaultValue if this deque is empty.
peekLast() - Method in class com.github.tommyettinger.gand.ds.IntDeque: Retrieves, but does not remove, the last element of this deque, or returns IntDeque.defaultValue if this deque is empty.
peekLast() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Retrieves, but does not remove, the last element of this deque, or returns defaultValue if this deque is empty.
physicalMap - Variable in class com.github.tommyettinger.gand.GradientGrid: Stores which parts of the map are accessible and which are not.
place(Object) - Method in class com.github.tommyettinger.gand.ds.ObjectSet: Returns an index >= 0 and <= ObjectSet.mask for the specified item.
plus(int) - Method in class com.github.tommyettinger.gand.ds.IntList: Adds value to each item in this IntList, stores it in this and returns it.
plus(int, int) - Method in class com.github.tommyettinger.gand.ds.IntList
poll() - Method in class com.github.tommyettinger.gand.ds.IntDeque: Retrieves and removes the head of the queue represented by this deque (in other words, the first element of this deque), or returns IntDeque.defaultValue if this deque is empty.
poll() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Retrieves and removes the head of the queue represented by this deque (in other words, the first element of this deque), or returns defaultValue if this deque is empty.
pollFirst() - Method in class com.github.tommyettinger.gand.ds.IntDeque: Retrieves and removes the first element of this deque, or returns defaultValue if this deque is empty.
pollFirst() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Retrieves and removes the first element of this deque, or returns defaultValue if this deque is empty.
pollLast() - Method in class com.github.tommyettinger.gand.ds.IntDeque: Retrieves and removes the last element of this deque, or returns defaultValue if this deque is empty.
pollLast() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Retrieves and removes the last element of this deque, or returns defaultValue if this deque is empty.
pop() - Method in class com.github.tommyettinger.gand.ds.IntDeque: Pops an element from the stack represented by this deque.
pop() - Method in class com.github.tommyettinger.gand.ds.IntList: Removes and returns the last item.
pop() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Pops an element from the stack represented by this deque.
previous() - Method in class com.github.tommyettinger.gand.algorithms.SearchStep
previous() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque.ObjectDequeIterator: Returns the previous element in the list and moves the cursor position backwards.
previousIndex() - Method in class com.github.tommyettinger.gand.ds.IntDeque.IntDequeIterator: Returns the index of the element that would be returned by a subsequent call to IntDeque.IntDequeIterator.previousInt().
previousIndex() - Method in class com.github.tommyettinger.gand.ds.IntList.IntListIterator: Returns the index of the element that would be returned by a subsequent call to IntList.IntListIterator.previousInt().
previousIndex() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque.ObjectDequeIterator: Returns the index of the element that would be returned by a subsequent call to ObjectDeque.ObjectDequeIterator.previous().
previousInt() - Method in class com.github.tommyettinger.gand.ds.IntDeque.IntDequeIterator: Returns the previous element in the list and moves the cursor position backwards.
previousInt() - Method in class com.github.tommyettinger.gand.ds.IntList.IntListIterator: Returns the previous element in the list and moves the cursor position backwards.
previousInt() - Method in class com.github.tommyettinger.gand.utils.Choo32Random
previousInt() - Method in class com.github.tommyettinger.gand.utils.Taxon32Random
previousLong() - Method in class com.github.tommyettinger.gand.utils.Choo32Random
previousLong() - Method in class com.github.tommyettinger.gand.utils.Taxon32Random
push(int) - Method in class com.github.tommyettinger.gand.ds.IntDeque: Pushes an element onto the stack represented by this deque (in other words, at the head of this deque) if it is possible to do so immediately without violating capacity restrictions, throwing an IllegalStateException if no space is currently available.
push(T) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Pushes an element onto the stack represented by this deque (in other words, at the head of this deque) if it is possible to do so immediately without violating capacity restrictions, throwing an IllegalStateException if no space is currently available.

R

random - Variable in class com.github.tommyettinger.gand.TwistedLineI2
random - Variable in class com.github.tommyettinger.gand.TwistedLineI3
random(Random) - Method in class com.github.tommyettinger.gand.ds.IntDeque
random(Random) - Method in class com.github.tommyettinger.gand.ds.IntList: Returns a random item from the list, or zero if the list is empty.
random(Random) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque
randomize(float) - Method in class com.github.tommyettinger.gand.TwistedLineI2: This sets up a random maze as an Int2UndirectedGraph so a path can be found.
randomize(float) - Method in class com.github.tommyettinger.gand.TwistedLineI3: This sets up a random maze as an Int3UndirectedGraph so a path can be found.
RaycastCollisionDetector<T extends com.github.tommyettinger.crux.PointN<T>> - Interface in com.github.tommyettinger.gand.smoothing: A RaycastCollisionDetector finds the closest intersection between a ray and any object in the game world.
read(Json, JsonValue) - Method in class com.github.tommyettinger.gand.DirectedGraph
read(Json, JsonValue) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque
read(Json, JsonValue) - Method in class com.github.tommyettinger.gand.ds.ObjectSet
read(Json, JsonValue) - Method in class com.github.tommyettinger.gand.Float2DirectedGraph
read(Json, JsonValue) - Method in class com.github.tommyettinger.gand.Float2UndirectedGraph
read(Json, JsonValue) - Method in class com.github.tommyettinger.gand.Float3DirectedGraph
read(Json, JsonValue) - Method in class com.github.tommyettinger.gand.Float3UndirectedGraph
read(Json, JsonValue) - Method in class com.github.tommyettinger.gand.Int2DirectedGraph
read(Json, JsonValue) - Method in class com.github.tommyettinger.gand.Int2UndirectedGraph
read(Json, JsonValue) - Method in class com.github.tommyettinger.gand.Int3DirectedGraph
read(Json, JsonValue) - Method in class com.github.tommyettinger.gand.Int3UndirectedGraph
read(Json, JsonValue) - Method in class com.github.tommyettinger.gand.Path
read(Json, JsonValue) - Method in class com.github.tommyettinger.gand.UndirectedGraph
read(Json, JsonValue) - Method in class com.github.tommyettinger.gand.utils.Choo32Random
read(Json, JsonValue) - Method in class com.github.tommyettinger.gand.utils.FlowRandom
read(Json, JsonValue) - Method in class com.github.tommyettinger.gand.utils.Taxon32Random
readExternal(ObjectInput) - Method in class com.github.tommyettinger.gand.Graph: Meant for deserialization using Fury.
refresh(Path<V>) - Method in class com.github.tommyettinger.gand.smoothing.PathSmootherRequest
registerAll(Json) - Static method in class com.github.tommyettinger.gand.utils.JsonRegistration
registerGridPoint2(Json) - Static method in class com.github.tommyettinger.gand.utils.JsonRegistration
registerGridPoint3(Json) - Static method in class com.github.tommyettinger.gand.utils.JsonRegistration
registerVector2(Json) - Static method in class com.github.tommyettinger.gand.utils.JsonRegistration
registerVector3(Json) - Static method in class com.github.tommyettinger.gand.utils.JsonRegistration
registerVector4(Json) - Static method in class com.github.tommyettinger.gand.utils.JsonRegistration
reinitialize(PointI2[], float) - Method in class com.github.tommyettinger.gand.TwistedLineI2: This sets up a random maze as a Int2UndirectedGraph so a path can be found, using the given array of PointI2 to represent which cells on a 2D grid can actually be traversed easily (and so can be used in a random path).
reinitialize(PointI3[], float) - Method in class com.github.tommyettinger.gand.TwistedLineI3: This sets up a random maze as a Int3UndirectedGraph so a path can be found, using the given array of PointI3 to represent which cells on a 3D grid can actually be traversed (and so can be used in a random path).
rem(int) - Method in class com.github.tommyettinger.gand.ds.IntList: Gets the remainder of each item in this IntList with value, stores it in this and returns it.
rem(int, int) - Method in class com.github.tommyettinger.gand.ds.IntList
remove() - Method in class com.github.tommyettinger.gand.ds.IntDeque.IntDequeIterator: Removes from the list the last element that was returned by IntDeque.IntDequeIterator.nextInt() or IntDeque.IntDequeIterator.previousInt() (optional operation).
remove() - Method in class com.github.tommyettinger.gand.ds.IntDeque: Retrieves and removes the head of the queue represented by this deque (in other words, the first element of this deque).
remove() - Method in class com.github.tommyettinger.gand.ds.IntList.IntListIterator: Removes from the list the last element that was returned by IntList.IntListIterator.nextInt() or IntList.IntListIterator.previousInt() (optional operation).
remove() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque.ObjectDequeIterator: Removes from the list the last element that was returned by ObjectDeque.ObjectDequeIterator.next() or ObjectDeque.ObjectDequeIterator.previous() (optional operation).
remove() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Retrieves and removes the head of the queue represented by this deque (in other words, the first element of this deque).
remove() - Method in class com.github.tommyettinger.gand.ds.ObjectOrderedSet.ObjectOrderedSetIterator
remove() - Method in class com.github.tommyettinger.gand.ds.ObjectSet.ObjectSetIterator
remove(int) - Method in interface com.github.tommyettinger.gand.ds.IntCollection
remove(int) - Method in class com.github.tommyettinger.gand.ds.IntDeque: Removes the first occurrence of the specified element from this deque.
remove(int) - Method in class com.github.tommyettinger.gand.ds.IntList: Removes the first occurrence of value from this IntList, returning true if anything was removed.
remove(Object) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Removes the first occurrence of the specified element from this deque.
remove(Object) - Method in class com.github.tommyettinger.gand.ds.ObjectOrderedSet
remove(Object) - Method in class com.github.tommyettinger.gand.ds.ObjectSet: Returns true if the key was removed.
removeAll(int[]) - Method in interface com.github.tommyettinger.gand.ds.IntCollection
removeAll(int[], int, int) - Method in interface com.github.tommyettinger.gand.ds.IntCollection
removeAll(IntCollection) - Method in interface com.github.tommyettinger.gand.ds.IntCollection: Removes from this collection all occurrences of any elements contained in the specified other collection.
removeAll(IntCollection) - Method in class com.github.tommyettinger.gand.ds.IntList: Removes from this IntList all occurrences of any elements contained in the specified collection.
removeAll(Object[]) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Exactly like ObjectDeque.removeAll(Collection), but takes an array instead of a Collection.
removeAll(Object[]) - Method in class com.github.tommyettinger.gand.ds.ObjectSet
removeAll(Object[], int, int) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Like ObjectDeque.removeAll(Object[]), but only uses at most length items from array, starting at offset.
removeAll(Object[], int, int) - Method in class com.github.tommyettinger.gand.ds.ObjectSet
removeAll(Collection<?>) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Removes all of this collection's elements that are also contained in the specified collection (optional operation).
removeAll(Collection<?>) - Method in class com.github.tommyettinger.gand.ds.ObjectSet
removeAllEdges() - Method in class com.github.tommyettinger.gand.Graph: Removes all edges from the graph.
removeAllVertices() - Method in class com.github.tommyettinger.gand.Graph: Removes all vertices and edges from the graph.
removeAt(int) - Method in class com.github.tommyettinger.gand.ds.IntDeque: Removes and returns the item at the specified index.
removeAt(int) - Method in class com.github.tommyettinger.gand.ds.IntList: Removes and returns the item at the specified index.
removeAt(int) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Removes and returns the item at the specified index.
removeAt(int) - Method in class com.github.tommyettinger.gand.ds.ObjectOrderedSet: Removes and returns the item at the given index in this set's order.
removeEach(int[]) - Method in interface com.github.tommyettinger.gand.ds.IntCollection
removeEach(int[], int, int) - Method in interface com.github.tommyettinger.gand.ds.IntCollection
removeEach(IntCollection) - Method in interface com.github.tommyettinger.gand.ds.IntCollection: Removes from this collection element-wise occurrences of elements contained in the specified other collection.
removeEach(IntCollection) - Method in class com.github.tommyettinger.gand.ds.IntList: Removes from this IntList element-wise occurrences of elements contained in the specified collection.
removeEach(Iterable<?>) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Removes from this collection element-wise occurrences of elements contained in the specified other collection.
removeEach(Object[]) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Exactly like ObjectDeque.removeEach(Iterable), but takes an array instead of a Collection.
removeEach(Object[], int, int) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Like ObjectDeque.removeEach(Object[]), but only uses at most length items from array, starting at offset.
removeEdge(Edge<V>) - Method in class com.github.tommyettinger.gand.Graph
removeEdge(V, V) - Method in class com.github.tommyettinger.gand.Graph: Removes the edge from v to w from the graph.
removeEdgeIf(ObjectPredicate<Edge<V>>) - Method in class com.github.tommyettinger.gand.Graph
removeEdges(Collection<? extends Edge<V>>) - Method in class com.github.tommyettinger.gand.Graph
removeFirst() - Method in class com.github.tommyettinger.gand.ds.IntDeque: Remove the first item from the queue.
removeFirst() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Remove the first item from the queue.
removeFirstOccurrence(int) - Method in class com.github.tommyettinger.gand.ds.IntDeque: Removes the first occurrence of the specified element from this deque.
removeFirstOccurrence(Object) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Removes the first occurrence of the specified element from this deque.
removeIf(IntPredicate) - Method in interface com.github.tommyettinger.gand.ds.IntCollection: Removes all the elements of this collection that satisfy the given predicate.
removeLast() - Method in class com.github.tommyettinger.gand.ds.IntDeque: Remove the last item from the queue.
removeLast() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Remove the last item from the queue.
removeLastOccurrence(int) - Method in class com.github.tommyettinger.gand.ds.IntDeque: Removes the last occurrence of the specified element from this deque.
removeLastOccurrence(Object) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Removes the last occurrence of the specified element from this deque.
removeLastValue(int) - Method in class com.github.tommyettinger.gand.ds.IntDeque: Removes the last instance of the specified value in the queue.
removeLastValue(Object, boolean) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Removes the last instance of the specified value in the queue.
removeRange(int, int) - Method in class com.github.tommyettinger.gand.ds.IntList: Removes the items between the specified start index, inclusive, and end index, exclusive.
removeRange(int, int) - Method in class com.github.tommyettinger.gand.ds.ObjectOrderedSet: Removes the items between the specified start index, inclusive, and end index, exclusive.
removeValue(int) - Method in class com.github.tommyettinger.gand.ds.IntDeque: Removes the first instance of the specified value in the queue.
removeValue(Object, boolean) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Removes the first instance of the specified value in the queue.
removeVertex(V) - Method in class com.github.tommyettinger.gand.Graph: Removes a vertex from the graph, and any adjacent edges.
removeVertexIf(ObjectPredicate<V>) - Method in class com.github.tommyettinger.gand.Graph
removeVertices(Collection<V>) - Method in class com.github.tommyettinger.gand.Graph: Removes all the vertices in the collection from the graph, and any adjacent edges.
requestRunID() - Method in class com.github.tommyettinger.gand.algorithms.Algorithms
reset() - Method in class com.github.tommyettinger.gand.ds.IntDeque.IntDequeIterator
reset() - Method in class com.github.tommyettinger.gand.ds.IntList.IntListIterator
reset() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque.ObjectDequeIterator
reset() - Method in class com.github.tommyettinger.gand.ds.ObjectOrderedSet.ObjectOrderedSetIterator
reset() - Method in class com.github.tommyettinger.gand.ds.ObjectSet.ObjectSetIterator
reset() - Method in class com.github.tommyettinger.gand.GradientGrid: Resets this GradientGrid to a state with no goals, no discovered path, and no changes made to gradientMap relative to physicalMap.
reset(int) - Method in class com.github.tommyettinger.gand.ds.IntDeque.IntDequeIterator
reset(int) - Method in class com.github.tommyettinger.gand.ds.IntList.IntListIterator
reset(int) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque.ObjectDequeIterator
resetAlgorithmAttribs(int) - Method in class com.github.tommyettinger.gand.Node
resetCell(int, int) - Method in class com.github.tommyettinger.gand.GradientGrid: Reverts a cell to the value stored in the original state of the level as known by physicalMap.
resetCell(Point2<?>) - Method in class com.github.tommyettinger.gand.GradientGrid: Reverts a cell to the value stored in the original state of the level as known by physicalMap.
resetMap() - Method in class com.github.tommyettinger.gand.GradientGrid: Resets the gradientMap to its original value from physicalMap.
resize(int) - Method in class com.github.tommyettinger.gand.ds.IntDeque: Resize backing array.
resize(int) - Method in class com.github.tommyettinger.gand.ds.IntList
resize(int) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Resize backing array.
resize(int) - Method in class com.github.tommyettinger.gand.ds.ObjectSet
retainAll(IntCollection) - Method in interface com.github.tommyettinger.gand.ds.IntCollection
retainAll(IntCollection) - Method in class com.github.tommyettinger.gand.ds.IntList: Removes all items from this IntList that are not present somewhere in other, any number of times.
retainAll(Object[]) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Exactly like ObjectDeque.retainAll(Collection), but takes an array instead of a Collection.
retainAll(Object[], int, int) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Like ObjectDeque.retainAll(Object[]), but only uses at most length items from array, starting at offset.
retainAll(Collection<?>) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Retains only the elements in this collection that are contained in the specified collection (optional operation).
retainAll(Collection<?>) - Method in class com.github.tommyettinger.gand.ds.ObjectSet
reverse() - Method in class com.github.tommyettinger.gand.ds.IntDeque: Reverses this IntDeque in-place.
reverse() - Method in class com.github.tommyettinger.gand.ds.IntList
reverse() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Reverses this ObjectDeque in-place.
reversed() - Method in interface com.github.tommyettinger.gand.utils.IntComparator
reversed() - Method in class com.github.tommyettinger.gand.utils.IntComparators.NaturalImplicitComparator
reversed() - Method in class com.github.tommyettinger.gand.utils.IntComparators.OppositeComparator
reversed() - Method in class com.github.tommyettinger.gand.utils.IntComparators.OppositeImplicitComparator
reversed() - Method in class com.github.tommyettinger.gand.utils.IntComparators.UnsignedComparator
reversed() - Method in class com.github.tommyettinger.gand.utils.IntComparators.UnsignedOppositeComparator
RIGHT - Enum constant in enum class com.github.tommyettinger.gand.utils.Direction
rng - Variable in class com.github.tommyettinger.gand.GradientGrid: The Choo32Random used to decide which one of multiple equally-short paths to take; this has its state set deterministically before any usage.

S

scan() - Method in class com.github.tommyettinger.gand.GradientGrid: Recalculate the GradientGrid and return it.
scan(Point2<?>, Iterable<? extends Point2<?>>) - Method in class com.github.tommyettinger.gand.GradientGrid: Recalculate the GradientGrid and return it.
scan(Point2<?>, Iterable<? extends Point2<?>>, boolean) - Method in class com.github.tommyettinger.gand.GradientGrid: Recalculate the GradientGrid and return it.
scan(Point2<?>, Iterable<? extends Point2<?>>, int) - Method in class com.github.tommyettinger.gand.GradientGrid: Recalculate the GradientGrid for a creature that is potentially larger than 1x1 cell and return it.
scan(Iterable<? extends Point2<?>>) - Method in class com.github.tommyettinger.gand.GradientGrid: Recalculate the GradientGrid and return it.
scan(Iterable<? extends Point2<?>>, int) - Method in class com.github.tommyettinger.gand.GradientGrid: Recalculate the GradientGrid for a creature that is potentially larger than 1x1 cell and return it.
SearchProcessor<V> - Interface in com.github.tommyettinger.gand.utils: Essentially the same as a Consumer<SearchStep<V>>, this is a functional interface that is typically run by search algorithms at each step.
SearchStep<V> - Class in com.github.tommyettinger.gand.algorithms: An object representing a "step" in a search algorithm.
serializeToString() - Method in class com.github.tommyettinger.gand.utils.Choo32Random: Produces a String that holds the entire state of this Choo32Random.
serializeToString() - Method in class com.github.tommyettinger.gand.utils.FlowRandom: Produces a String that holds the entire state of this FlowRandom.
serializeToString() - Method in class com.github.tommyettinger.gand.utils.Taxon32Random: Produces a String that holds the entire state of this Taxon32Random.
set - Variable in class com.github.tommyettinger.gand.ds.ObjectSet.ObjectSetIterator: The set to iterate over.
set(int) - Method in class com.github.tommyettinger.gand.ds.IntDeque.IntDequeIterator: Replaces the last element returned by IntDeque.IntDequeIterator.nextInt() or IntDeque.IntDequeIterator.previousInt() with the specified element (optional operation).
set(int) - Method in class com.github.tommyettinger.gand.ds.IntList.IntListIterator: Replaces the last element returned by IntList.IntListIterator.nextInt() or IntList.IntListIterator.previousInt() with the specified element (optional operation).
set(int, int) - Method in class com.github.tommyettinger.gand.ds.IntDeque: Sets an existing position in this deque to the given item.
set(int, int) - Method in class com.github.tommyettinger.gand.ds.IntList
set(int, T) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Sets an existing position in this deque to the given item.
set(T) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque.ObjectDequeIterator: Replaces the last element returned by ObjectDeque.ObjectDequeIterator.next() or ObjectDeque.ObjectDequeIterator.previous() with the specified element (optional operation).
setBlockingRequirement(int) - Method in class com.github.tommyettinger.gand.GradientGrid: If you want obstacles present in orthogonal cells to prevent pathfinding along the diagonal between them, this can be used to make thin diagonal walls non-viable to move through, or even to prevent diagonal movement if any one obstacle is orthogonally adjacent to both the start and target cell of a diagonal move.
setConnection(Connection<V>) - Method in class com.github.tommyettinger.gand.Node
setDefaultEdgeWeight(float) - Method in class com.github.tommyettinger.gand.Graph: Set the default edge weight, which will be given to every edge for which the edge weight is not specified.
setDefaultValue(int) - Method in class com.github.tommyettinger.gand.ds.IntDeque
setDefaultValue(T) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque
setDistance(float) - Method in class com.github.tommyettinger.gand.Node
setEstimate(float) - Method in class com.github.tommyettinger.gand.Node
setFresh(int, int, float) - Method in class com.github.tommyettinger.gand.GradientGrid
setFresh(Point2<?>, float) - Method in class com.github.tommyettinger.gand.GradientGrid
setGoal(int, int) - Method in class com.github.tommyettinger.gand.GradientGrid: Marks a cell as a goal for pathfinding, unless the cell is a wall or unreachable area (then it does nothing).
setGoal(Point2<?>) - Method in class com.github.tommyettinger.gand.GradientGrid: Marks a cell as a goal for pathfinding, unless the cell is a wall or unreachable area (then it does nothing).
setGoals(Point2<?>[]) - Method in class com.github.tommyettinger.gand.GradientGrid: Marks many cells as goals for pathfinding, ignoring cells in walls or unreachable areas.
setGoals(Iterable<? extends Point2<?>>) - Method in class com.github.tommyettinger.gand.GradientGrid: Marks many cells as goals for pathfinding, ignoring cells in walls or unreachable areas.
setIndex(int) - Method in class com.github.tommyettinger.gand.Node
setInEdges(ArrayList<Connection<V>>) - Method in class com.github.tommyettinger.gand.Node
setLastRunID(int) - Method in class com.github.tommyettinger.gand.Node
setLength(float) - Method in class com.github.tommyettinger.gand.Path
setLoadFactor(float) - Method in class com.github.tommyettinger.gand.ds.ObjectSet
setMeasurement(GridMetric) - Method in class com.github.tommyettinger.gand.GradientGrid
setOccupied(int, int) - Method in class com.github.tommyettinger.gand.GradientGrid: Marks a specific cell in gradientMap as completely impossible to enter.
setOutEdges(ArrayList<Connection<V>>) - Method in class com.github.tommyettinger.gand.Node
setPrev(Node<V>) - Method in class com.github.tommyettinger.gand.Node
setProcessed(boolean) - Method in class com.github.tommyettinger.gand.Node
setRandom(Random) - Method in class com.github.tommyettinger.gand.TwistedLineI2
setRandom(Random) - Method in class com.github.tommyettinger.gand.TwistedLineI3
setSeed(int) - Method in class com.github.tommyettinger.gand.utils.Choo32Random: This initializes all 4 states of the generator to random values based on the given seed.
setSeed(int) - Method in class com.github.tommyettinger.gand.utils.Taxon32Random: This initializes both states of the generator to values based on the given seed.
setSeed(long) - Method in class com.github.tommyettinger.gand.utils.Choo32Random: This initializes all 4 states of the generator to random values based on the given seed.
setSeed(long) - Method in class com.github.tommyettinger.gand.utils.FlowRandom: This initializes both states of the generator to random values based on the given seed.
setSeed(long) - Method in class com.github.tommyettinger.gand.utils.Taxon32Random: This initializes both states of the generator to random values based on the given seed.
setSeen(boolean) - Method in class com.github.tommyettinger.gand.Node
setSelectedState(int, int) - Method in class com.github.tommyettinger.gand.utils.Choo32Random: Sets one of the states, determined by selection, to value, as-is.
setSelectedState(int, int) - Method in class com.github.tommyettinger.gand.utils.Taxon32Random: Sets one of the states, determined by selection, to the lower 32 bits of value, as-is.
setSize(int) - Method in class com.github.tommyettinger.gand.ds.IntList: Sets the list size, leaving any values beyond the current size undefined.
setState(int, int) - Method in class com.github.tommyettinger.gand.utils.Taxon32Random: Sets the state completely to the given state variables, casting each to an int.
setState(int, int, int, int) - Method in class com.github.tommyettinger.gand.utils.Choo32Random: Sets the state completely to the given four state variables, each an int.
setState(long, long) - Method in class com.github.tommyettinger.gand.utils.FlowRandom: This initializes both states of the generator to the two given states, verbatim.
setStateA(int) - Method in class com.github.tommyettinger.gand.utils.Choo32Random: Sets the first part of the state.
setStateA(int) - Method in class com.github.tommyettinger.gand.utils.Taxon32Random: Sets the first part of the state by casting the parameter to an int.
setStateB(int) - Method in class com.github.tommyettinger.gand.utils.Choo32Random: Sets the second part of the state.
setStateB(int) - Method in class com.github.tommyettinger.gand.utils.Taxon32Random: Sets the second part of the state by casting the parameter to an int.
setStateC(int) - Method in class com.github.tommyettinger.gand.utils.Choo32Random: Sets the third part of the state.
setStateD(int) - Method in class com.github.tommyettinger.gand.utils.Choo32Random: Sets the fourth part of the state.
setWeight(float) - Method in class com.github.tommyettinger.gand.Connection
setWeight(float) - Method in class com.github.tommyettinger.gand.Connection.UndirectedConnection
setWeight(float) - Method in class com.github.tommyettinger.gand.Edge
show() - Method in class com.github.tommyettinger.gand.Int2DirectedGraph: Creates a 1D char array (which can be passed to String.valueOf(char[])) filled with a grid made of the vertices in this Graph and their estimated costs, if this has done an estimate.
show() - Method in class com.github.tommyettinger.gand.Int2UndirectedGraph: Creates a 1D char array (which can be passed to String.valueOf(char[])) filled with a grid made of the vertices in this Graph and their estimated costs, if this has done an estimate.
show() - Method in class com.github.tommyettinger.gand.Int3DirectedGraph: Creates a 1D char array (which can be passed to String.valueOf(char[])) filled with a grid made of the vertices in this Graph and their estimated costs, if this has done an estimate.
show() - Method in class com.github.tommyettinger.gand.Int3UndirectedGraph: Creates a 1D char array (which can be passed to String.valueOf(char[])) filled with a grid made of the vertices in this Graph and their estimated costs, if this has done an estimate.
show(boolean) - Method in class com.github.tommyettinger.gand.Int2DirectedGraph: Creates a 1D char array (which can be passed to String.valueOf(char[])) filled with a grid made of the vertices in this Graph and their estimated costs, if this has done an estimate.
show(boolean) - Method in class com.github.tommyettinger.gand.Int2UndirectedGraph: Creates a 1D char array (which can be passed to String.valueOf(char[])) filled with a grid made of the vertices in this Graph and their estimated costs, if this has done an estimate.
shrink() - Method in class com.github.tommyettinger.gand.ds.IntList: Reduces the size of the backing array to the size of the actual items.
shrink(int) - Method in class com.github.tommyettinger.gand.ds.ObjectSet: Reduces the size of the backing arrays to be the specified capacity / loadFactor, or less.
shuffle(Random) - Method in class com.github.tommyettinger.gand.ds.IntList
shuffle(Random) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Pseudo-randomly shuffles the order of this Arrangeable in-place.
shuffle(T[]) - Method in class com.github.tommyettinger.gand.TwistedLineI2
shuffle(T[]) - Method in class com.github.tommyettinger.gand.TwistedLineI3
shuffleDirs() - Method in class com.github.tommyettinger.gand.GradientGrid
size - Variable in class com.github.tommyettinger.gand.ds.IntDeque: Number of elements in the queue.
size - Variable in class com.github.tommyettinger.gand.ds.IntList
size - Variable in class com.github.tommyettinger.gand.ds.ObjectDeque: Number of elements in the queue.
size - Variable in class com.github.tommyettinger.gand.ds.ObjectSet
size() - Method in interface com.github.tommyettinger.gand.ds.IntCollection
size() - Method in class com.github.tommyettinger.gand.ds.IntDeque: Returns the number of elements in this deque.
size() - Method in class com.github.tommyettinger.gand.ds.IntList
size() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Returns the number of elements in this deque.
size() - Method in class com.github.tommyettinger.gand.ds.ObjectSet: Returns the number of elements in this set (its cardinality).
size() - Method in class com.github.tommyettinger.gand.Graph: Get the number of vertices in the graph.
smoothPath(Path<V>) - Method in class com.github.tommyettinger.gand.smoothing.PathSmoother: Smooths the given path in place.
smoothPath(PathSmootherRequest<V>, long) - Method in class com.github.tommyettinger.gand.smoothing.PathSmoother: Smooths in place the path specified by the given request, possibly over multiple consecutive frames.
sort() - Method in class com.github.tommyettinger.gand.ds.IntDeque: Sorts this deque in-place using Arrays.sort(int[], int, int).
sort() - Method in class com.github.tommyettinger.gand.ds.IntList
sort() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Attempts to sort this deque in-place using its natural ordering, which requires T to implement Comparable of T.
sort() - Method in class com.github.tommyettinger.gand.ds.ObjectOrderedSet: Sorts this ObjectOrderedSet in-place by the keys' natural ordering; T must implement Comparable.
sort(int[], int, int, IntComparator) - Static method in class com.github.tommyettinger.gand.utils.IntComparators: Sorts the specified range of elements according to the order induced by the specified comparator using mergesort.
sort(int[], IntComparator) - Static method in class com.github.tommyettinger.gand.utils.IntComparators: Sorts all of items by simply calling IntComparators.sort(int[], int, int, IntComparator), setting from and to so the whole array is sorted.
sort(int, int, IntComparator) - Method in class com.github.tommyettinger.gand.ds.IntList: Sorts the specified range of elements according to the order induced by the specified comparator using mergesort, or Arrays.sort(int[], int, int) if c is null.
sort(IntComparator) - Method in class com.github.tommyettinger.gand.ds.IntDeque: Sorts this deque in-place using IntComparators.sort(int[], int, int, IntComparator).
sort(IntComparator) - Method in class com.github.tommyettinger.gand.ds.IntList: Sorts all elements according to the order induced by the specified comparator using IntComparators.sort(int[], int, int, IntComparator).
sort(Comparator<? super T>) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Sorts this deque in-place using Arrays.sort(Object[], int, int, Comparator).
sort(Comparator<? super T>) - Method in class com.github.tommyettinger.gand.ds.ObjectOrderedSet: Sorts this ObjectOrderedSet in-place by the given Comparator used on the keys.
sort(K[], int, int, Comparator<? super K>) - Static method in class com.github.tommyettinger.gand.utils.ObjectSort: Sorts the specified range of elements according to the order induced by the specified comparator using mergesort.
sort(K[], Comparator<? super K>) - Static method in class com.github.tommyettinger.gand.utils.ObjectSort: Sorts all of items by simply calling ObjectSort.sort(Object[], int, int, Comparator) setting from and to so the whole array is sorted.
sortEdges(Comparator<Connection<V>>) - Method in class com.github.tommyettinger.gand.Graph: Sort the edges using the provided comparator.
sortVertices(Comparator<V>) - Method in class com.github.tommyettinger.gand.Graph: Sort the vertices using the provided comparator.
stateA - Variable in class com.github.tommyettinger.gand.utils.Choo32Random: The first state; can be any int.
stateA - Variable in class com.github.tommyettinger.gand.utils.FlowRandom: The first state; can be any long.
stateA - Variable in class com.github.tommyettinger.gand.utils.Taxon32Random: The first state; can be any int.
stateB - Variable in class com.github.tommyettinger.gand.utils.Choo32Random: The second state; can be any int.
stateB - Variable in class com.github.tommyettinger.gand.utils.FlowRandom: The second state; can be any long.
stateB - Variable in class com.github.tommyettinger.gand.utils.Taxon32Random: The second state; can be any int.
stateC - Variable in class com.github.tommyettinger.gand.utils.Choo32Random: The third state; can be any int.
stateD - Variable in class com.github.tommyettinger.gand.utils.Choo32Random: The fourth state; can be any int.
swap(int, int) - Method in class com.github.tommyettinger.gand.ds.IntDeque: Switches the ordering of positions first and second, without changing any items beyond that.
swap(int, int) - Method in class com.github.tommyettinger.gand.ds.IntList
swap(int, int) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Switches the ordering of positions first and second, without changing any items beyond that.

T

tableSize(int, float) - Static method in class com.github.tommyettinger.gand.ds.Utilities: Used to establish the size of a hash table for ObjectSet and related code.
tail - Variable in class com.github.tommyettinger.gand.ds.IntDeque: Index of last element.
tail - Variable in class com.github.tommyettinger.gand.ds.ObjectDeque: Index of last element.
Taxon32Random - Class in com.github.tommyettinger.gand.utils: A random number generator that is optimized for performance on 32-bit machines and with Google Web Toolkit, this uses only the most portable operations (including compatibility with JS), and has a period of exactly 2 to the 64.
Taxon32Random() - Constructor for class com.github.tommyettinger.gand.utils.Taxon32Random: Creates a new Taxon32Random with a random state.
Taxon32Random(int) - Constructor for class com.github.tommyettinger.gand.utils.Taxon32Random: Creates a new Taxon32Random with the given seed; all int values are permitted for seed.
Taxon32Random(int, int) - Constructor for class com.github.tommyettinger.gand.utils.Taxon32Random: Creates a new Taxon32Random with the given two states; all int values are permitted.
Taxon32Random(long) - Constructor for class com.github.tommyettinger.gand.utils.Taxon32Random: Creates a new Taxon32Random with the given seed; all long values are permitted.
terminate() - Method in class com.github.tommyettinger.gand.algorithms.SearchStep: Immediately terminate the search.
test(int) - Method in interface com.github.tommyettinger.gand.utils.IntPredicate: Evaluates this predicate on the given arguments.
test(int, int) - Method in interface com.github.tommyettinger.gand.utils.IntIntPredicate: Evaluates this predicate on the given arguments.
test(int, int, int) - Method in interface com.github.tommyettinger.gand.utils.IntIntIntPredicate: Evaluates this predicate on the given arguments.
test(T) - Method in interface com.github.tommyettinger.gand.utils.ObjectPredicate: Evaluates this predicate on the given argument.
thenComparing(IntComparator) - Method in interface com.github.tommyettinger.gand.utils.IntComparator: Return a new comparator that first uses this comparator, then uses the second comparator if this comparator compared the two elements as equal.
thenComparing(Comparator<? super Integer>) - Method in interface com.github.tommyettinger.gand.utils.IntComparator
threshold - Variable in class com.github.tommyettinger.gand.ds.ObjectSet: Precalculated value of (int)(keyTable.length * loadFactor), used to determine when to resize.
throwModificationException() - Static method in class com.github.tommyettinger.gand.utils.Errors
throwNullItemException() - Static method in class com.github.tommyettinger.gand.utils.Errors
throwNullVertexException() - Static method in class com.github.tommyettinger.gand.utils.Errors
throwSameVertexException() - Static method in class com.github.tommyettinger.gand.utils.Errors
throwVertexNotInGraphVertexException(boolean) - Static method in class com.github.tommyettinger.gand.utils.Errors
TIME_TOLERANCE - Static variable in class com.github.tommyettinger.gand.smoothing.PathSmoother
times(int) - Method in class com.github.tommyettinger.gand.ds.IntList: Multiplies each item in this IntList by value, stores it in this and returns it.
times(int, int) - Method in class com.github.tommyettinger.gand.ds.IntList
toArray() - Method in interface com.github.tommyettinger.gand.ds.IntCollection: Allocates a new int array with exactly IntCollection.size() items, fills it with the contents of this PrimitiveCollection, and returns it.
toArray() - Method in class com.github.tommyettinger.gand.ds.IntDeque: Returns an array containing all of the elements in this collection.
toArray() - Method in class com.github.tommyettinger.gand.ds.IntList: Allocates a new int array with size elements and fills it with the items in this.
toArray() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Returns an array containing all of the elements in this collection.
toArray() - Method in class com.github.tommyettinger.gand.ds.ObjectSet
toArray(int[]) - Method in interface com.github.tommyettinger.gand.ds.IntCollection: Fills the given array with the entire contents of this PrimitiveCollection, up to IntCollection.size() items, or if receiver is not large enough, then this allocates a new int array with IntCollection.size() items and returns that.
toArray(int[]) - Method in class com.github.tommyettinger.gand.ds.IntList: If array.length at least equal to IntList.size(), this copies the contents of this into array and returns it; otherwise, it allocates a new int array that can fit all the items in this, and proceeds to copy into that and return that.
toArray(E[]) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Returns an array containing all of the elements in this collection; the runtime type of the returned array is that of the specified array.
toArray(E[]) - Method in class com.github.tommyettinger.gand.ds.ObjectSet: Returns an array containing all the elements in this set; the runtime type of the returned array is that of the specified array.
toGoTo(Point2<?>, Point2<?>) - Static method in enum class com.github.tommyettinger.gand.utils.Direction
toList() - Method in class com.github.tommyettinger.gand.ds.ObjectSet.ObjectSetIterator: Returns a new ArrayList containing the remaining items.
topologicalSort() - Method in class com.github.tommyettinger.gand.DirectedGraph: Sort the vertices of this graph in topological order.
topologicalSort(Collection<V>) - Method in class com.github.tommyettinger.gand.DirectedGraph: Perform a topological sort on the graph, and puts the sorted vertices in the supplied list.
toString() - Method in class com.github.tommyettinger.gand.Connection.DirectedConnection
toString() - Method in class com.github.tommyettinger.gand.Connection.UndirectedConnection
toString() - Method in class com.github.tommyettinger.gand.ds.IntDeque
toString() - Method in class com.github.tommyettinger.gand.ds.IntList
toString() - Method in class com.github.tommyettinger.gand.ds.ObjectDeque
toString() - Method in class com.github.tommyettinger.gand.ds.ObjectOrderedSet
toString() - Method in class com.github.tommyettinger.gand.ds.ObjectSet
toString() - Method in class com.github.tommyettinger.gand.Float2DirectedGraph
toString() - Method in class com.github.tommyettinger.gand.Float2UndirectedGraph
toString() - Method in class com.github.tommyettinger.gand.Float3DirectedGraph
toString() - Method in class com.github.tommyettinger.gand.Float3UndirectedGraph
toString() - Method in class com.github.tommyettinger.gand.Graph
toString() - Method in class com.github.tommyettinger.gand.Int2DirectedGraph
toString() - Method in class com.github.tommyettinger.gand.Int2UndirectedGraph
toString() - Method in class com.github.tommyettinger.gand.Int3DirectedGraph
toString() - Method in class com.github.tommyettinger.gand.Int3UndirectedGraph
toString() - Method in class com.github.tommyettinger.gand.Node
toString() - Method in class com.github.tommyettinger.gand.Path
toString() - Method in class com.github.tommyettinger.gand.utils.Choo32Random
toString() - Method in class com.github.tommyettinger.gand.utils.FlowRandom
toString() - Method in class com.github.tommyettinger.gand.utils.Taxon32Random
toString(boolean) - Method in class com.github.tommyettinger.gand.Int2DirectedGraph
toString(boolean) - Method in class com.github.tommyettinger.gand.Int2UndirectedGraph
toString(String) - Method in class com.github.tommyettinger.gand.ds.IntDeque
toString(String) - Method in class com.github.tommyettinger.gand.ds.IntList
toString(String) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque
toString(String) - Method in class com.github.tommyettinger.gand.ds.ObjectOrderedSet
toString(String) - Method in class com.github.tommyettinger.gand.ds.ObjectSet
toString(String) - Method in class com.github.tommyettinger.gand.Path
truncate(int) - Method in class com.github.tommyettinger.gand.ds.IntDeque: Reduces the size of the deque to the specified size.
truncate(int) - Method in class com.github.tommyettinger.gand.ds.IntList: Reduces the size of the list to the specified size.
truncate(int) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque: Reduces the size of the deque to the specified size.
truncate(int) - Method in class com.github.tommyettinger.gand.ds.ObjectOrderedSet: Reduces the size of the set to the specified size.
truncate(int) - Method in class com.github.tommyettinger.gand.ds.ObjectSet: Reduces the size of the set to the specified size.
TwistedLineI2 - Class in com.github.tommyettinger.gand: This generates orthogonally-connected paths of PointI2 that meander through an area; this won't ever generate paths that cross themselves.
TwistedLineI2() - Constructor for class com.github.tommyettinger.gand.TwistedLineI2: You probably don't want this constructor; use TwistedLineI2(Random, PointI2[], float) instead.
TwistedLineI2(Random, PointI2[]) - Constructor for class com.github.tommyettinger.gand.TwistedLineI2: Builds a TwistedLineI2 and calls TwistedLineI2.reinitialize(PointI2[], float) using the given traversable points.
TwistedLineI2(Random, PointI2[], float) - Constructor for class com.github.tommyettinger.gand.TwistedLineI2: Builds a TwistedLineI2 and calls TwistedLineI2.reinitialize(PointI2[], float) using the given traversable points.
TwistedLineI3 - Class in com.github.tommyettinger.gand: This generates orthogonally-connected paths of PointI3 that meander through an area; this won't ever generate paths that cross themselves.
TwistedLineI3() - Constructor for class com.github.tommyettinger.gand.TwistedLineI3: You probably don't want this constructor; use TwistedLineI3(Random, PointI3[], float) instead.
TwistedLineI3(Random, PointI3[]) - Constructor for class com.github.tommyettinger.gand.TwistedLineI3: Builds a TwistedLineI3 and calls TwistedLineI3.reinitialize(PointI3[], float) using the given traversable points.
TwistedLineI3(Random, PointI3[], float) - Constructor for class com.github.tommyettinger.gand.TwistedLineI3: Builds a TwistedLineI3 and calls TwistedLineI3.reinitialize(PointI3[], float) using the given traversable points.

U

UndirectedConnection() - Constructor for class com.github.tommyettinger.gand.Connection.UndirectedConnection
UndirectedGraph<V> - Class in com.github.tommyettinger.gand
UndirectedGraph() - Constructor for class com.github.tommyettinger.gand.UndirectedGraph
UndirectedGraph(Graph<V>) - Constructor for class com.github.tommyettinger.gand.UndirectedGraph
UndirectedGraph(Collection<V>) - Constructor for class com.github.tommyettinger.gand.UndirectedGraph
UndirectedGraph(Collection<V>, Collection<Edge<V>>, float) - Constructor for class com.github.tommyettinger.gand.UndirectedGraph
UndirectedGraphAlgorithms<V> - Class in com.github.tommyettinger.gand.algorithms
UndirectedGraphAlgorithms(UndirectedGraph<V>) - Constructor for class com.github.tommyettinger.gand.algorithms.UndirectedGraphAlgorithms
UNSIGNED_COMPARATOR - Static variable in class com.github.tommyettinger.gand.utils.IntComparators
UNSIGNED_OPPOSITE_COMPARATOR - Static variable in class com.github.tommyettinger.gand.utils.IntComparators
UnsignedComparator() - Constructor for class com.github.tommyettinger.gand.utils.IntComparators.UnsignedComparator
UnsignedOppositeComparator() - Constructor for class com.github.tommyettinger.gand.utils.IntComparators.UnsignedOppositeComparator
UP - Enum constant in enum class com.github.tommyettinger.gand.utils.Direction
UP_LEFT - Enum constant in enum class com.github.tommyettinger.gand.utils.Direction
UP_RIGHT - Enum constant in enum class com.github.tommyettinger.gand.utils.Direction
update() - Method in class com.github.tommyettinger.gand.algorithms.Algorithm
update() - Method in class com.github.tommyettinger.gand.algorithms.AStarSearch
update() - Method in class com.github.tommyettinger.gand.algorithms.BreadthFirstSearch
update() - Method in class com.github.tommyettinger.gand.algorithms.CycleDetector
update() - Method in class com.github.tommyettinger.gand.algorithms.DepthFirstSearch
update() - Method in class com.github.tommyettinger.gand.algorithms.MinimumWeightSpanningTree
Utilities - Class in com.github.tommyettinger.gand.ds: Utility code shared by various data structures in this package.

V

valid - Variable in class com.github.tommyettinger.gand.ds.IntDeque.IntDequeIterator
valid - Variable in class com.github.tommyettinger.gand.ds.IntList.IntListIterator
valid - Variable in class com.github.tommyettinger.gand.ds.ObjectDeque.ObjectDequeIterator
valid - Variable in class com.github.tommyettinger.gand.ds.ObjectSet.ObjectSetIterator: Internally employed by the iterator-reuse functionality.
valueOf(String) - Static method in enum class com.github.tommyettinger.gand.utils.Direction: Returns the enum constant of this class with the specified name.
valueOf(String) - Static method in enum class com.github.tommyettinger.gand.utils.GridMetric: Returns the enum constant of this class with the specified name.
values - Variable in class com.github.tommyettinger.gand.ds.IntDeque: Contains the values in the queue.
values - Variable in class com.github.tommyettinger.gand.ds.ObjectDeque: Contains the values in the queue.
values() - Static method in enum class com.github.tommyettinger.gand.utils.Direction: Returns an array containing the constants of this enum class, in the order they are declared.
values() - Static method in enum class com.github.tommyettinger.gand.utils.GridMetric: Returns an array containing the constants of this enum class, in the order they are declared.
vertex() - Method in class com.github.tommyettinger.gand.algorithms.SearchStep

W

WALL - Static variable in class com.github.tommyettinger.gand.GradientGrid: Walls, which are solid no-entry cells, are marked with a high number equal to 999500f .
wallQuery(int, int) - Method in class com.github.tommyettinger.gand.GradientGrid
width - Variable in class com.github.tommyettinger.gand.GradientGrid
with(int) - Static method in class com.github.tommyettinger.gand.ds.IntDeque
with(int) - Static method in class com.github.tommyettinger.gand.ds.IntList
with(int...) - Static method in class com.github.tommyettinger.gand.ds.IntDeque
with(int...) - Static method in class com.github.tommyettinger.gand.ds.IntList
with(T) - Static method in class com.github.tommyettinger.gand.ds.ObjectDeque
with(T) - Static method in class com.github.tommyettinger.gand.ds.ObjectOrderedSet
with(T) - Static method in class com.github.tommyettinger.gand.ds.ObjectSet
with(T) - Static method in class com.github.tommyettinger.gand.Path
with(T...) - Static method in class com.github.tommyettinger.gand.ds.ObjectDeque
with(T...) - Static method in class com.github.tommyettinger.gand.ds.ObjectOrderedSet
with(T...) - Static method in class com.github.tommyettinger.gand.ds.ObjectSet
with(T...) - Static method in class com.github.tommyettinger.gand.Path
workingEdit(int, int) - Method in class com.github.tommyettinger.gand.GradientGrid: An internal extension point for GradientGrid, this can be implemented in different ways depending on whether P is a mutable or immutable type.
workingEdit(int, int) - Method in class com.github.tommyettinger.gand.GradientGridI2
workingEdit(Point2<?>) - Method in class com.github.tommyettinger.gand.GradientGrid: Simply calls GradientGrid.workingEdit(int, int) with (other.xi(), other.yi()).
workRay - Variable in class com.github.tommyettinger.gand.GradientGrid
write(Json) - Method in class com.github.tommyettinger.gand.DirectedGraph
write(Json) - Method in class com.github.tommyettinger.gand.ds.ObjectDeque
write(Json) - Method in class com.github.tommyettinger.gand.ds.ObjectSet
write(Json) - Method in class com.github.tommyettinger.gand.Float2DirectedGraph
write(Json) - Method in class com.github.tommyettinger.gand.Float2UndirectedGraph
write(Json) - Method in class com.github.tommyettinger.gand.Float3DirectedGraph
write(Json) - Method in class com.github.tommyettinger.gand.Float3UndirectedGraph
write(Json) - Method in class com.github.tommyettinger.gand.Int2DirectedGraph
write(Json) - Method in class com.github.tommyettinger.gand.Int2UndirectedGraph
write(Json) - Method in class com.github.tommyettinger.gand.Int3DirectedGraph
write(Json) - Method in class com.github.tommyettinger.gand.Int3UndirectedGraph
write(Json) - Method in class com.github.tommyettinger.gand.Path
write(Json) - Method in class com.github.tommyettinger.gand.UndirectedGraph
write(Json) - Method in class com.github.tommyettinger.gand.utils.Choo32Random
write(Json) - Method in class com.github.tommyettinger.gand.utils.FlowRandom
write(Json) - Method in class com.github.tommyettinger.gand.utils.Taxon32Random
writeExternal(ObjectOutput) - Method in class com.github.tommyettinger.gand.Graph: Meant for serialization using Fury.

A B C D E F G H I J K L M N O P R S T U V W
All Classes and Interfaces|All Packages|Constant Field Values|Serialized Form