org.organicdesign.fp

Class FunctionUtils.UnmodifiableSortedMap<K,V>

java.lang.Object

org.organicdesign.fp.FunctionUtils.UnmodifiableSortedMap<K,V>

All Implemented Interfaces:

Serializable, Iterable<UnmodMap.UnEntry<K,V>>, Map<K,V>, SortedMap<K,V>, Sized, UnmodIterable<UnmodMap.UnEntry<K,V>>, UnmodMap<K,V>, UnmodSortedIterable<UnmodMap.UnEntry<K,V>>, UnmodSortedMap<K,V>, Transformable<UnmodMap.UnEntry<K,V>>

Enclosing class:

FunctionUtils

public static class FunctionUtils.UnmodifiableSortedMap<K,V>
extends Object
implements UnmodSortedMap<K,V>, Serializable

Wraps a sorted map. The result will be serializable to the extent that the wrapped sorted map is. You probably want to use this by calling FunctionUtils.unmodSortedMap(SortedMap).

See Also:

Serialized Form

Nested Class Summary

Nested classes/interfaces inherited from interface org.organicdesign.fp.collections.UnmodMap

UnmodMap.AbstractUnmodMap<K,V>, UnmodMap.UnEntry<K,V>

Nested classes/interfaces inherited from interface java.util.Map

Map.Entry<K,V>

Nested classes/interfaces inherited from interface org.organicdesign.fp.collections.UnmodIterable

UnmodIterable.AbstractUnmodIterable<T>

Method Summary

Modifier and Type	Method and Description
Comparator<? super K>	comparator()
boolean	containsKey(Object key)
boolean	containsValue(Object value) Most maps are not designed for this - the default implementation has O(n) performance.
boolean	equals(Object o)
K	firstKey()
V	get(Object key)
int	hashCode()
boolean	isEmpty()
UnmodSortedIterator<UnmodMap.UnEntry<K,V>>	iterator() A one-time use, mutable, not-thread-safe way to get each value of the underling collection in turn.
K	lastKey()
int	size() Returns the number of items in this iterable.
UnmodSortedMap<K,V>	subMap(K fromKey, K toKey)
UnmodSortedMap<K,V>	tailMap(K fromKey)
String	toString()

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface org.organicdesign.fp.collections.UnmodSortedMap

entrySet, headMap, keySet, values

Methods inherited from interface org.organicdesign.fp.collections.UnmodMap

clear, compute, computeIfAbsent, computeIfPresent, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll

Methods inherited from interface java.util.Map

forEach, getOrDefault

Methods inherited from interface org.organicdesign.fp.collections.UnmodSortedIterable

castFromList, castFromSortedMap, castFromSortedSet, equal, equals

Methods inherited from interface org.organicdesign.fp.collections.UnmodIterable

concat, drop, filter, flatMap, foldLeft, foldLeft, hash, hashCode, head, map, precat, take, takeWhile, toString

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Methods inherited from interface org.organicdesign.fp.xform.Transformable

toImList, toImMap, toImSet, toImSortedMap, toImSortedSet, toMutableList, toMutableMap, toMutableSet, toMutableSortedMap, toMutableSortedSet

Method Detail

size

public int size()

Description copied from interface: Sized

Returns the number of items in this iterable.

Specified by:

size in interface Map<K,V>

Specified by:

size in interface Sized

isEmpty

public boolean isEmpty()

Description copied from interface: UnmodMap

Specified by:

isEmpty in interface Map<K,V>

Specified by:

isEmpty in interface UnmodMap<K,V>

containsKey

public boolean containsKey(Object key)

Specified by:

containsKey in interface Map<K,V>

containsValue

public boolean containsValue(Object value)

Description copied from interface: UnmodMap

Most maps are not designed for this - the default implementation has O(n) performance.

Specified by:

containsValue in interface Map<K,V>

Specified by:

containsValue in interface UnmodMap<K,V>

get

public V get(Object key)

Specified by:

get in interface Map<K,V>

comparator

public Comparator<? super K> comparator()

Specified by:

comparator in interface SortedMap<K,V>

subMap

public UnmodSortedMap<K,V> subMap(K fromKey,
                                  K toKey)

Description copied from interface: UnmodSortedMap

Specified by:

subMap in interface SortedMap<K,V>

Specified by:

subMap in interface UnmodSortedMap<K,V>

tailMap

public UnmodSortedMap<K,V> tailMap(K fromKey)

Description copied from interface: UnmodSortedMap

Specified by:

tailMap in interface SortedMap<K,V>

Specified by:

tailMap in interface UnmodSortedMap<K,V>

firstKey

public K firstKey()

Specified by:

firstKey in interface SortedMap<K,V>

lastKey

public K lastKey()

Specified by:

lastKey in interface SortedMap<K,V>

iterator

public UnmodSortedIterator<UnmodMap.UnEntry<K,V>> iterator()

Description copied from interface: UnmodIterable

A one-time use, mutable, not-thread-safe way to get each value of the underling collection in turn. I experimented with various thread-safe alternatives, but the JVM is optimized around iterators so this is the lowest common denominator of collection iteration, even though iterators are inherently mutable.

Specified by:

iterator in interface Iterable<UnmodMap.UnEntry<K,V>>

Specified by:

iterator in interface UnmodIterable<UnmodMap.UnEntry<K,V>>

Specified by:

iterator in interface UnmodSortedIterable<UnmodMap.UnEntry<K,V>>

hashCode

public int hashCode()

Specified by:

hashCode in interface Map<K,V>

Overrides:

hashCode in class Object

equals

public boolean equals(Object o)

Specified by:

equals in interface Map<K,V>

Overrides:

equals in class Object

toString

public String toString()

Overrides:

toString in class Object