Class Hierarchy

Go to the graphical class hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:

[detail level 1234]

Caud.A234Tree< Key extends Comparable	Simple implementation of 2-3-4-trees based on KTreeNode
Caud.test.A234TreeTest
►Caud.adt.AbstractQueue< T >	Interface for an ADT queue
►Caud.Queue< T >	Implementation of AbstractQueue as a (dynamically resized) circular buffer based on array
Caud.example.VerboseQueue< T >	A queue that outputs messages on enqueue and dequeue
Caud.QueueDL< T >	Impementation of AbstractQueue based on doubly linked list DList
►Caud.adt.AbstractStack< T >	Interface for an ADT stack
►Caud.Stack< T >	Implementation of a stack based on aud.Vector
Caud.example.VerboseStack< T >	A stack that outputs messages on push and pop
►Caud.example.expr.AtomicExpression	Superclass for data associated with a tree node
►Caud.example.expr.Operator	Node representing operator in an expression tree
Caud.example.expr.Divide	Binary / operator: A/B
Caud.example.expr.Minus	Binary - operator: A-B
Caud.example.expr.Plus	Binary + operator: A+B
Caud.example.expr.Power	Binary power operator: A^B (also A**B)
Caud.example.expr.Times	Binary * operator: A*B
Caud.example.expr.UnaryMinus	Unary - operator: -A ("sign")
►Caud.example.expr.Terminal	Node represents a terminal AtomicExpression
Caud.example.expr.Number	Node representing constant number
Caud.example.expr.Symbol	Node representing a symbolic parameter, e.g., a variable
Caud.AVLTree< Key extends Comparable	Simple implementation of an AVL tree
Caud.test.AVLTreeTest
Caud.BinarySearchTree< Key extends Comparable	Base class for a binary search tree
►CBinarySearchTree< Key, Value >Node
Caud.AVLTree.AVLNode	Node in an AVLTree
Caud.RedBlackTree.RBNode	Node in a RedBlackTree
Caud.test.BinarySearchTreeTest
Caud.BinaryTree< AtomicExpression >
►Caud.BinaryTree< Entry >
Caud.BinarySearchTree.Node	Node in a BinarySearchTree
Caud.BinaryTree< String >
Caud.test.BinaryTreeTest
Caud.BinaryTreeTraversal< T >	Provide traversals of binary trees
Caud.BTree< Key extends Comparable	Simple implementation of B-trees based on KTreeNode
Caud.test.BTreeTest
Caud.util.Colormap< T >	Simple interface for color map
►Caud.util.Colormap< Double >
Caud.util.ColormapJet	Map values in [minValue,maxValue] to color
►Caud.util.Colormap< Integer >
Caud.util.ColormapCount	Color map for (small) positive integer counts
Caud.BinarySearchTree.Cursor	Reference to a key-value pair in a BinarySearchTree
►CDecorator
Caud.RedBlackTree.RedBlackDecorator
Caud.DList<?>
Caud.test.DListTest
Caud.util.DotViewer	Simple viewer for Graphvizable
Caud.BinarySearchTree.Entry	Key-value pair as entry (= node data) in a search tree
Caud.KTreeNode.Entry	Entry in a KTreeNode with reference to key and left child
►Caud.example.expr.ExpressionParser	Simple expression parser
Caud.example.expr.ExpressionParser2	Same as ExpressionParser but using modified grammar to provide the usual left-associative expressions
Caud.example.expr.ExpressionTreeExample	ExpressionTree: minimal example
Caud.util.Graphviz	Use GraphViz to render graph structures
►Caud.util.Graphvizable	Interface for GraphViz rendering
►Caud.BinaryTree< T >	Simple binary tree
Caud.example.expr.ExpressionTree	Tree representation of arithmetic expression
Caud.DList< T >	Implementation of a doubly linked list
Caud.SList< T >	Implementation of a singly linked list
►Caud.util.GraphvizDecorable	Interface for decorating items of Graphvizable objects
Caud.BinaryTree< T >	Simple binary tree
►Caud.util.GraphvizDecorator	Decorator for items of Graphvizable objects
►Caud.util.CommonGraphvizDecorator	Interface for simple decorator with preset properties
►Caud.util.SimpleDecorator	Example for a simple decorator
Caud.BinarySearchTree.Decorator	Enables decoration "by key"
►CIterable
Caud.BinarySearchTree.Range	Iterable range (subsequence)
Caud.BinaryTreeTraversal< T >.Inorder	Helper: generates InorderIterator
Caud.BinaryTreeTraversal< T >.Levelorder	Helper: generates LevelorderIterator
Caud.BinaryTreeTraversal< T >.Postorder	Helper: generates PostorderIterator
Caud.BinaryTreeTraversal< T >.Preorder	Helper: generates PreorderIterator
►Caud.BinaryTreeTraversal< T >.Traversal	Base class for traversal
Caud.BinaryTreeTraversal< T >.Inorder	Helper: generates InorderIterator
Caud.BinaryTreeTraversal< T >.Levelorder	Helper: generates LevelorderIterator
Caud.BinaryTreeTraversal< T >.Postorder	Helper: generates PostorderIterator
Caud.BinaryTreeTraversal< T >.Preorder	Helper: generates PreorderIterator
Caud.DList< T >	Implementation of a doubly linked list
Caud.DList< T >.Backwards	Utility class to obtain a BackwardIterator
Caud.SList< T >	Implementation of a singly linked list
Caud.Vector< T >	Implementation of an array-based vector
Caud.util.Permutations	Generate permutations
Caud.example.IterativePreorderTraversal	Example: transform recursive preoder traversal to iterative algorithm
►Cjava.util.Iterator
Caud.BinarySearchTree.Iterator	Inorder iterator
Caud.BinarySearchTree.RangeIterator	Iterator over Range
►Caud.DList< T >.ForwardIterator	Forward iterator
Caud.DList< T >.BackwardIterator	Backward iterator
Caud.SList< T >.Iterator	Forward iterator
Caud.Vector< T >.Iterator	Forward iterator
Caud.util.PermutationIterator	Iterator over all permutations of length n
Caud.BinarySearchTree.Iterator< aud.BinaryTree< aud.BinarySearchTree.Entry > >
►Caud.BinarySearchTree.Iterator< BinaryTree< T > >
Caud.BinaryTreeTraversal< T >.LevelorderIterator	Level-order iterator for BinaryTree
►Caud.BinaryTreeTraversal< T >.RecursiveTraversalIterator	Base class for stack-based pre-/in-/postorder traversal
Caud.BinaryTreeTraversal< T >.InorderIterator	Inorder iterator for BinaryTree
Caud.BinaryTreeTraversal< T >.PostorderIterator	Postorder iterator for BinaryTree
Caud.BinaryTreeTraversal< T >.PreorderIterator	Preorder iterator for BinaryTree
Caud.KTreeNode< Key extends Comparable	Node in a k-ary search tree
►Caud.util.LexicalScanner	Base class for a simple lexical scanner
Caud.example.expr.Tokenizer	Breaks input string into pieces ("tokens")
Caud.BinarySearchTree.LowerBound	Result of findLowerBound
Caud.DList< T >.Node
Caud.example.Hanoi.InorderIterator.Node	Solution state interpreted as a binary tree
Caud.SList< T >.Node
Caud.Queue< aud.BinaryTree< T > >
Caud.test.QueueTest
Caud.RedBlackTree< Key extends Comparable	Simple implementation of a red-black tree
Caud.test.RedBlackTreeTest
Caud.example.RenderTree	Utility for rendering various trees
Caud.test.RunTests
►CRuntimeException
Caud.example.expr.SyntaxError	Signals syntax error during parsing a term
►Caud.util.SingleStepper	Simple framework for single stepping code
Caud.example.A234TreeExample	Example: insert entries
Caud.example.AVLTreeExample	Example: insert entries and maintain balance
Caud.example.BTreeExample	Example: insert entries
Caud.example.BinarySearchTreeExample	Example: insert, remove, and restructure entries
Caud.example.BinaryTreeTraversal	Example: visualize binary tree traversal
Caud.example.RedBlackTreeExample	Example: insert entries and maintain balance
Caud.example.expr.ExpressionTreeTraversal	Example: visualize expression tree traversal
Caud.util.SingleStepperDemo	Demonstrate use of SingleStepper
Caud.test.SListTest
Caud.Stack< aud.BinaryTree< T > >
Caud.Stack< aud.example.Hanoi.InorderIterator.Node >
Caud.Stack< Integer >
Caud.test.StackTest
Caud.util.SVGViewer	Simple SVG viewer based on Batik's SVGCanvas
Caud.util.Sys	System related utilities
Caud.example.expr.AtomicExpression.Type	Type identifiers returned by getType
Caud.test.VectorTest