| Package | Description |
|---|---|
| org.organicdesign.fp |
A data definition language, and other tools for writing functional Java.
|
| org.organicdesign.fp.collections |
Type-safe versions of the immutable Clojure collections, plus unmodifiable and immutable
collection interfaces that extend the java.util collections, deprecating the mutate-in-place
methods (Unmod____) and adding methods that return a new, immutable, modified version of the
collection (Im____).
|
| org.organicdesign.fp.tuple |
Immutable, type-safe, heterogeneous containers - ML calls these "records."
ML, Haskell, and Scala use tuples - why not Java?
Actually, tuples are *more* important in Java because Java does not have type aliases.
|
| Modifier and Type | Method and Description |
|---|---|
UnmodIterator<UnmodMap.UnEntry<K,V>> |
FunctionUtils.UnmodifiableMap.iterator()
A one-time use, mutable, not-thread-safe way to get each value of the underling collection in
turn.
|
UnmodSortedIterator<UnmodMap.UnEntry<K,V>> |
FunctionUtils.UnmodifiableSortedMap.iterator() |
| Modifier and Type | Class and Description |
|---|---|
class |
KeyVal<K,V>
Deprecated.
|
| Modifier and Type | Method and Description |
|---|---|
static <K,V> UnmodMap.UnEntry<K,V> |
UnmodMap.UnEntry.entryToUnEntry(Map.Entry<K,V> entry)
Deprecated.
|
UnmodMap.UnEntry<K,V> |
PersistentTreeMap.last()
Returns the last key/value pair in this map, or null if the map is empty.
|
UnmodMap.UnEntry<K,V> |
UnmodMap.UnEntry.EntryToUnEntryIter.next() |
| Modifier and Type | Method and Description |
|---|---|
static <K,V> UnmodSortedIterable<UnmodMap.UnEntry<K,V>> |
UnmodSortedIterable.castFromSortedMap(SortedMap<K,V> sm) |
Option<UnmodMap.UnEntry<K,V>> |
ImSortedMap.entry(K key) |
Option<UnmodMap.UnEntry<K,V>> |
PersistentTreeMap.entry(K key)
Returns an Option of the key/value pair matching the given key, or Option.none() if the key is
not found.
|
Option<UnmodMap.UnEntry<K,V>> |
PersistentHashMap.entry(K key) |
Option<UnmodMap.UnEntry<K,V>> |
PersistentHashMap.MutableHashMap.entry(K key) |
Option<UnmodMap.UnEntry<K,V>> |
ImMap.entry(K key) |
static <K,V> UnmodSortedIterator<UnmodMap.UnEntry<K,V>> |
UnmodMap.UnEntry.entryIterToUnEntrySortedUnIter(Iterator<Map.Entry<K,V>> innerIter) |
static <K,V> UnmodIterator<UnmodMap.UnEntry<K,V>> |
UnmodMap.UnEntry.entryIterToUnEntryUnIter(Iterator<Map.Entry<K,V>> innerIter) |
Option<UnmodMap.UnEntry<K,V>> |
PersistentTreeMap.head()
The first item in this sequence.
|
UnmodSortedIterator<UnmodMap.UnEntry<K,V>> |
ImSortedMap.iterator()
Returns an iterator over the UnEntries of this map in order.
|
UnmodSortedIterator<UnmodMap.UnEntry<K,V>> |
PersistentTreeMap.iterator()
Returns an iterator over the UnEntries of this map in order.
|
UnmodIterator<UnmodMap.UnEntry<K,V>> |
PersistentHashMap.iterator() |
UnmodIterator<UnmodMap.UnEntry<K,V>> |
PersistentHashMap.MutableHashMap.iterator() |
| Modifier and Type | Class and Description |
|---|---|
class |
Tuple2<A,B>
Holds 2 items of potentially different types, and implements Map.Entry (and UnmodMap.UnEntry
(there is no ImMap.ImEntry)).
|
Copyright © 2017. All rights reserved.