Package | Description |
---|---|
javaslang | |
javaslang.collection |
Purely functional collections based on Traversable.
|
javaslang.concurrent |
This package contains basic building blocks creating fast, asynchronous, non-blocking parallel code.
|
javaslang.control |
Class and Description |
---|
Array
Array is a Traversable wrapper for
Object[] containing elements of type T . |
CharSeq
The CharSeq (read: character sequence) collection essentially is a rich String wrapper having all operations
we know from the functional Javaslang collections.
|
Iterator
javaslang.collection.Iterator is a compositional replacement for java.util.Iterator
whose purpose is to iterate once over a sequence of elements. |
List
An immutable
List is an eager sequence of elements. |
List.Cons
Non-empty
List , consisting of a head and a tail . |
List.Nil
Representation of the singleton empty
List . |
Map
An immutable
Map interface. |
Queue
An immutable
Queue stores elements allowing a first-in-first-out (FIFO) retrieval. |
Seq
Interface for immutable sequential data structures.
|
Set
An immutable
Set interface. |
Stack
An immutable
Stack stores elements allowing a last-in-first-out (LIFO) retrieval. |
Stream
An immutable
Stream is lazy sequence of elements which may be infinitely long. |
Stream.Cons
Non-empty
Stream , consisting of a head , and tail . |
Stream.Empty
The empty Stream.
|
Tree
A general Tree interface.
|
Vector
Vector is the default Seq implementation.
|
Class and Description |
---|
Array
Array is a Traversable wrapper for
Object[] containing elements of type T . |
CharSeq
The CharSeq (read: character sequence) collection essentially is a rich String wrapper having all operations
we know from the functional Javaslang collections.
|
Foldable
Interface of folable data structures.
|
HashMap
An immutable
HashMap implementation based on a
Hash array mapped trie (HAMT). |
HashSet
An immutable
HashSet implementation. |
IndexedSeq
Interface for immutable, indexed sequences.
|
Iterator
javaslang.collection.Iterator is a compositional replacement for java.util.Iterator
whose purpose is to iterate once over a sequence of elements. |
LinearSeq
Interface for immutable, linear sequences.
|
LinkedHashMap
An immutable
LinkedHashMap implementation. |
LinkedHashSet
An immutable
HashSet implementation. |
List
An immutable
List is an eager sequence of elements. |
List.Nil
Representation of the singleton empty
List . |
Map
An immutable
Map interface. |
Queue
An immutable
Queue stores elements allowing a first-in-first-out (FIFO) retrieval. |
Seq
Interface for immutable sequential data structures.
|
Set
An immutable
Set interface. |
SortedMap
An immutable
SortedMap interface. |
SortedSet
An immutable
SortedSet interface. |
Stack
An immutable
Stack stores elements allowing a last-in-first-out (LIFO) retrieval. |
Stream
An immutable
Stream is lazy sequence of elements which may be infinitely long. |
Stream.Empty
The empty Stream.
|
Traversable
An interface for inherently recursive, multi-valued data structures.
|
Tree
A general Tree interface.
|
Tree.Empty
The empty tree.
|
Tree.Node
Represents a tree node.
|
Tree.Order
Tree traversal order.
|
TreeMap
SortedMap implementation, backed by a Red/Black Tree.
|
TreeSet
SortedSet implementation, backed by a Red/Black Tree.
|
Vector
Vector is the default Seq implementation.
|
Class and Description |
---|
Iterator
javaslang.collection.Iterator is a compositional replacement for java.util.Iterator
whose purpose is to iterate once over a sequence of elements. |
Seq
Interface for immutable sequential data structures.
|
Class and Description |
---|
Iterator
javaslang.collection.Iterator is a compositional replacement for java.util.Iterator
whose purpose is to iterate once over a sequence of elements. |
List
An immutable
List is an eager sequence of elements. |
Seq
Interface for immutable sequential data structures.
|
Copyright © 2016. All Rights Reserved.