|
|||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
Interface Summary | |
Cloneable | A class implements the Cloneable interface to indicate
to the Object.clone() method in class Object
that it is legal for that method to make a field-for-field
copy of instances of that class. |
Comparitor | The comparitor interface should be implemented by objects, which are intended to work as comparitor for sorting objects using a sorter object or something similar. |
ControlledCloneable | A class implementing the ControlledCloneable interface
indicates to the Object.clone() method in class Object
that it is legal for that method to make a field-for-field
copy of instances of that class. |
Cursor | The interface defining the basic functionality of a Cursor . |
DebugListener | A listener to debug algorithms. |
KeyValueHolder | A class that implements KeyValueHolder can store a key and an object.
|
ListItem | The interface ListItem is used for doubly connected lists, stacks and
queues for example.Although BasicList , etc. implements Serializable ,
ListItem doesn't. |
Owner | Objects that implement Owner will have to be asked for permission by
member objects, before these may change their internal state.
|
Parameters | Interface declaring methods for parameter handling via indices. |
PriorityQueue | An interface that defines the basic methods for priority queues. |
SweepEvent |
An event interface for events belonging to Sweeps . |
SweepListener | The implementation of the SweepListener -interface is an alternative
to overriding the Sweep.processEvent(gishur.core.SweepEvent) -method in an own Sweep
-class. |
TreeItem | The basic interface for tree nodes. |
Class Summary | |
ArrayEnumeration | The ArrayEnumeration enumerates arrays (of Objects ) via
the Enumeration interface of java.util . |
BasicList | A rudimentary and efficient doubly connected list. |
BasicListItem | Basic ListItem , which only contains connections and an owner, but no
object or key. |
BasicTree | Fundamental methods for trees. |
BasicTreeItem |
Most simple TreeItem . |
BinarySearchTree |
A binary search tree based upon BasicTree . |
ClassFilter | A Filter , that accepts (rejects) an Object , if it is
(not) an instance of a (any) class stored. |
ClipList | A list type supporting clipping features. |
ConcatEnumeration | A ConcatEnumeration -object is an Enumeration that enumerates some
Enumerations . |
CursorAdapter | A basic class implementing the Cursor -interface. |
ExtMath | A class supplying mathematical functionary which is not included in
java.lang.Math . |
FibonacciHeap | A FibonacciHeap is a PriorityQueue .
|
FibonacciNode | A FibonacciNode is only used for FibonacciHeaps !
|
Filter | The Filter class provides a simple way to establish a pipeline
of filters in a conjunctive way. |
HashComparitor |
The most simple and fastest Comparitor . |
List |
A list type based upon SimpleList . |
ListView | A ListView object permits (restricted) read access to a list.
|
ParameterContainer | Class able to store parameter sets. { |
Queue | A simple queue based upon BasicList . |
RedBlackTree |
A red-black-tree, i.e. a completely balanced BinarySearchTree tree with those features:
Each node is either red or black
Each leaf is black
Each red node has only black sons
Each descending path from a node to any leaf contains the same number of black nodes.
To ensure the completeness of the tree, the null -pointers at the former
leafs must now supposed to be leafs (but BasicTreeItem.isLeaf() still returns true
for nodes with a null -pointer).
|
SimpleList |
A SimpleList is doubly connected list based upon BasicList .
{ |
SimpleListItem | A simple ListItem, which only stores a value. |
SimpleTreeItem | A simple binary tree node containing only one value. |
Sorter | This class implements several sorting-algorithms. |
Stack | A simple stack based upon BasicList . |
StdComparitor |
Standard Comparitor type. |
StdListItem | A standard ListItem . |
StdTreeItem | Standard TreeItem for trees. |
Sweep | The basic class for sweep algorithms. |
SweepEventComparitor |
A SweepEventComparitor compares SweepEvents using
another Comparitor (which must at least be able to compare
KeyValueHolder -objects). |
SweepTreeItem | A TreeItem for a binary tree. |
Switch | Utilities for switch statements. |
Exception Summary | |
CompareException |
A CompareException will indicate an error occurring at the comparison
of two objects. |
FunctionNotSupportedException | Thrown to indicate that a (declared) called function is not supported in the used implementation. |
LinkException | Exception thrown by dynamic data structures while linking. |
ListException | Exception thrown by classes based on BasicList (like
SimpleList , {Stack or Queue ). |
TreeException | Exception thrown by classes based on BasicTree (like
BinarySearchTree or {RedBlackTree ). |
Provides core data structures as lists and trees.
|
|||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |