See: Description
Interface | Description |
---|---|
BinaryTree<T> |
A binary tree implementation where each node keeps a value.
|
List<T> |
An immutable List implementation, suitable for concurrent programming.
|
RoseTree<T> |
A rose tree implementation, i.e.
|
RoseTree.NonNil<T> |
Implementors of this tagging interface indicate that they are not Nil.
|
Seq<T> |
Interface for sequential, traversable data structures.
|
Stream<T> |
A Lazy linked list implementation.
|
Traversable<T> |
An interface for inherently recursive data structures.
|
Tree<T> |
A general Tree interface.
|
Class | Description |
---|---|
BinaryTree.AbstractBinaryTree<T> |
An abstract binary tree implementation which just overrides equals, hashCode and toString.
|
BinaryTree.Branch<T> |
Representation of a binary tree branch.
|
BinaryTree.Leaf<T> |
Representation of a binary tree leaf.
|
BinaryTree.Nil<T> |
The singleton instance of the empty binary tree.
|
List.AbstractList<T> |
This class is needed because the interface
List cannot use default methods to override Object's non-final
methods equals, hashCode and toString. |
List.Cons<T> |
Non-empty List.
|
List.Nil<T> |
Representation of the singleton empty List.
|
RoseTree.AbstractRoseTree<T> |
An abstract rose tree implementation which just overrides equals, hashCode and toString.
|
RoseTree.Branch<T> |
Representation of a rose tree branch.
|
RoseTree.Leaf<T> |
Representation of a rose tree leaf.
|
RoseTree.Nil<T> |
The singleton instance of the empty rose tree.
|
Stream.AbstractStream<T> |
This class is needed because the interface
Stream cannot use default methods to override Object's non-final
methods equals, hashCode and toString. |
Stream.Cons<T> |
Non-empty Stream.
|
Stream.Deferred<T> |
Deferred Stream for lazy evaluation of blocking input.
|
Stream.Nil<T> |
The empty Stream.
|
Enum | Description |
---|---|
Tree.Order |
Tree traversal order.
|
Immutable collections based on Traversable like the linked list List and the lazy linked list Stream.
Copyright © 2015. All Rights Reserved.