A B C D E F G H I L M N O P R S T U V W X Y
All Classes All Packages
All Classes All Packages
All Classes All Packages
A
- add(T, double) - Method in class minpq.DoubleMapMinPQ
- add(T, double) - Method in interface minpq.ExtrinsicMinPQ
-
Adds an item with the given priority value.
- add(T, double) - Method in class minpq.HeapMinPQ
- add(T, double) - Method in class minpq.OptimizedHeapMinPQ
- add(T, double) - Method in class minpq.UnsortedArrayMinPQ
- addAll(Collection<? extends CharSequence>) - Method in interface autocomplete.Autocomplete
-
Adds the given collection of autocompletion terms.
- addAll(Collection<? extends CharSequence>) - Method in class autocomplete.BinarySearchAutocomplete
- addAll(Collection<? extends CharSequence>) - Method in class autocomplete.SequentialSearchAutocomplete
- addAll(Collection<? extends CharSequence>) - Method in class autocomplete.TernarySearchTreeAutocomplete
- addAll(Collection<? extends CharSequence>) - Method in class autocomplete.TreeSetAutocomplete
- addAllComments(Map<Double, String>, ExtrinsicMinPQ<String>) - Static method in class minpq.moderator.ModeratorMultiTest
-
Add all comments and toxicities to the given priority queue.
- addComments(ExtrinsicMinPQ<String>, Scanner, int) - Static method in class minpq.moderator.Moderator
-
Adds up to N comments from the scanner to the priority queue with negated weights.
- addEdge(Location, Location) - Method in class huskymaps.MapGraph
-
Adds an edge to this graph if it doesn't already exist, using distance as the weight.
- AdjacencyListSeamFinder - Class in seamcarving
-
Adjacency list graph single-source
ShortestPathSolver
implementation of theSeamFinder
interface. - AdjacencyListSeamFinder(ShortestPathSolver.Constructor<Node>) - Constructor for class seamcarving.AdjacencyListSeamFinder
-
Constructs an instance with the given
ShortestPathSolver
implementation. - AdjacencyListSeamFinder.PixelGraph - Class in seamcarving
-
Adjacency list graph of
AdjacencyListSeamFinder.PixelGraph.Pixel
vertices andEnergyFunction
-weighted edges. - AdjacencyListSeamFinder.PixelGraph.Pixel - Class in seamcarving
-
A pixel in the
AdjacencyListSeamFinder.PixelGraph
representation of thePicture
withEnergyFunction
-weighted edges to neighbors. - allMatches(CharSequence) - Method in interface autocomplete.Autocomplete
-
Returns all autocompletion terms that match the given prefix.
- allMatches(CharSequence) - Method in class autocomplete.BinarySearchAutocomplete
- allMatches(CharSequence) - Method in class autocomplete.SequentialSearchAutocomplete
- allMatches(CharSequence) - Method in class autocomplete.TernarySearchTreeAutocomplete
- allMatches(CharSequence) - Method in class autocomplete.TreeSetAutocomplete
- ALLOWED_HIGHWAY_TYPES - Static variable in class huskymaps.Constants
-
Only allow for non-service roads.
- apply(Picture, int, int) - Method in class seamcarving.DualGradientEnergyFunction
- apply(Picture, int, int) - Method in interface seamcarving.EnergyFunction
-
Returns the energy of pixel (x, y) in the given picture.
- AStarGraph<V> - Interface in graphs
-
Directed, edge-weighted graph with a heuristic function to estimate distances between vertices.
- AStarSolver<V> - Class in graphs
-
A* search implementation for single-pair shortest paths in an
AStarGraph
. - AStarSolver(AStarGraph<V>, V, V) - Constructor for class graphs.AStarSolver
-
Constructs a new instance by executing A* search on the graph from the start to the goal.
- autocomplete - package autocomplete
- autocomplete - Variable in class huskymaps.MapGraph
- Autocomplete - Interface in autocomplete
-
Suggest exact-character prefix matches for any query
CharSequence
. - autocomplete.cities - package autocomplete.cities
- autocomplete.dna - package autocomplete.dna
All Classes All Packages