All Classes and Interfaces

Class
Description
A heap that allows the compare functions to be specified.
A tree backed by an array.
Base85 codec.
 
 
 
To track when a point has been visited, when a node is visited it is given a color.
Maps iteration over a list of iterators that return the same type.
An input stream that is a concatination of several other input streams.
 
This performs much the same function as the VectorTileGroup but surrounding the shape with a constant field.
An EObject is an enumerable object.
A feature is a map of strings to strings and an orderd list of points.
A class that builds new Features.
A collection of static methods to help FileRingInputStream and FileRingOutputStream operate.
 
A class that reads and writes over a ring of files.
 
Return true when a file size is exceeded.
 
A grouping filter is a type of Predicate that may be combined with other instances.
 
 
 
 
 
 
 
 
A half-open interval the starts at point a and continues until point b but excluding point b.
An implementation of a Augmented Interval Tree backed by a Red Black Tree.
 
Contours are lines in a square.
This is almost identical to the JScrollingTextPane except this does not use buffer size but line number as its determiner of when to remove lines from the buffer.
 
 
KDTree<K extends Comparable<K>,V>
A k-d tree that operates much like a traditional binary search tree.
This is a more general version of a key.
This is an interface to objects that represent sets of keys.
 
A lazy file output stream delays opening a file to write until its internal buffer is filled.
And output stream that buffers data and opens and writes that data only when the buffer is full.
 
Java's linked list library is excellent, but we need direct access to manipulate the next reference.
 
A ListVisitor is passed to the foreach(...) method of a List implementation.
A generalization of interpolation.
 
Utility class for writing a .png with some meta data.
 
This output stream blocks when a send will exceed its rate limit.
An implementation of an Red Black Tree.
An implementation of a Red Black Tree.
 
RTree<D extends Comparable<D>,T>
 
A closure that allows searching to be stopped by the caller of a function.
This class implements a standard search three.
Sets are different than Collections.
A side is one cell value and optionally one or two points on the edge of a Tile.
 
An exception that does not record the stack trace.
A very naive method to build a simple GeoJSON object.
How to convert the X and Y values of the points in the VectorTile to a latitude and longitude.
A grid to world method that treats X and Y as being proportional to latitude and longitude.
This interface is so that any sorting structure can use different sorting methods.
 
 
 
 
This is a simple class for displaying an image.
This is a union-find set.
This class extends DefaultMutableTreeNode but uses an RedBlackTree to guarantee that no child may be added whose toString method returns a string that has already been added.
 
 
A vector tile group connects many Tile objects so they may be joined to a single VectorTile.
Representation of a dot-separated version string.