Package | Description |
---|---|
prefuse |
The top-level Visualization and Display classes, as well as Constants
used throughout the toolkit.
|
prefuse.action |
A library of reusable and composable modules
for performing data processing or assigning visual attributes.
|
prefuse.data |
Table, Graph, and Tree data structures for organizing data.
|
prefuse.data.column |
Data columns for storing typed data within a data table.
|
prefuse.data.expression |
Classes implementing an SQL-like expression language for filtering and manipulating data.
|
prefuse.data.tuple |
Implementing classes for data tuples, object proxies to a row of table
data.
|
prefuse.data.util |
Utility classes for supporting prefuse data structures, including
indexes, iterators, filters, and column projections.
|
prefuse.util.collections |
Utility classes providing useful data structures not present in the Java
Collections framework.
|
prefuse.util.io |
Utility classes pertaining to input and output.
|
Class and Description |
---|
CopyOnWriteArrayList
A thread-safe variant of
ArrayList in which all mutative
operations (add, set, and so on) are implemented by
making a fresh copy of the underlying array. |
Class and Description |
---|
CopyOnWriteArrayList
A thread-safe variant of
ArrayList in which all mutative
operations (add, set, and so on) are implemented by
making a fresh copy of the underlying array. |
Class and Description |
---|
CopyOnWriteArrayList
A thread-safe variant of
ArrayList in which all mutative
operations (add, set, and so on) are implemented by
making a fresh copy of the underlying array. |
IntIterator
Abstract LiteralIterator implementation that supports an iteration over
int values.
|
Class and Description |
---|
CopyOnWriteArrayList
A thread-safe variant of
ArrayList in which all mutative
operations (add, set, and so on) are implemented by
making a fresh copy of the underlying array. |
Class and Description |
---|
CopyOnWriteArrayList
A thread-safe variant of
ArrayList in which all mutative
operations (add, set, and so on) are implemented by
making a fresh copy of the underlying array. |
Class and Description |
---|
IntIterator
Abstract LiteralIterator implementation that supports an iteration over
int values.
|
Class and Description |
---|
AbstractLiteralIterator
Abstract base class for a LiteralIterator implementations.
|
IncompatibleComparatorException
Exception indicating a comparator is incompatible with the data type
to be compared.
|
IntIntSortedMap
Sorted map that maps from an int key to an int value.
|
IntIterator
Abstract LiteralIterator implementation that supports an iteration over
int values.
|
IntSortedMap |
LiteralIterator |
Queue
Maintains a breadth-first-search queue as well as depth labels.
|
Class and Description |
---|
AbstractHashMap
Abstract base class for hash maps holding objects or primitive data types
such as
int , float , etc. as keys and/or
values. |
AbstractLiteralIterator
Abstract base class for a LiteralIterator implementations.
|
AbstractTreeMap
Abstract base class for red-black trees that map a key value to
an int value.
|
AbstractTreeMap.Entry |
AbstractTreeMap.EntryIterator |
BooleanIntSortedMap
Sorted map that maps from a boolean key to an int value.
|
DefaultLiteralComparator
Default LiteralComparator implementation that uses the natural ordering
of all data types for comparing values.
|
DoubleIntSortedMap
Sorted map that maps from a double key to an int value.
|
FloatIntSortedMap
Sorted map that maps from a float key to an int value.
|
IncompatibleComparatorException
Exception indicating a comparator is incompatible with the data type
to be compared.
|
IntIntSortedMap
Sorted map that maps from an int key to an int value.
|
IntIterator
Abstract LiteralIterator implementation that supports an iteration over
int values.
|
IntSortedMap |
LiteralComparator |
LiteralIterator |
LongIntSortedMap
Sorted map that maps from a long key to an int value.
|
ObjectIntSortedMap
Sorted map that maps from an Object key to an int value.
|
Class and Description |
---|
ByteArrayList
A resizable array that maintains a list of byte values.
|
Copyright ? 2013 Regents of the University of California