public class SortedMapAdapter<K,V> extends AbstractMutableSortedMap<K,V> implements Serializable
To create a new wrapper around an existing SortedMap instance, use the adapt(SortedMap) factory method.
| Modifier and Type | Method and Description |
|---|---|
static <K,V> MutableSortedMap<K,V> |
adapt(SortedMap<K,V> map) |
void |
clear() |
MutableSortedMap<K,V> |
clone() |
Comparator<? super K> |
comparator() |
boolean |
containsKey(Object key) |
boolean |
containsValue(Object value) |
MutableList<V> |
distinct()
Returns a new
OrderedIterable containing the distinct elements in this iterable. |
MutableSortedMap<K,V> |
drop(int count)
Returns an iterable after skipping the first
count elements
or an empty iterable if the count is greater than the length of the iterable. |
MutableSortedMap<K,V> |
dropWhile(Predicate<? super V> predicate)
Returns the final elements that do not satisfy the Predicate.
|
MutableSet<Map.Entry<K,V>> |
entrySet() |
boolean |
equals(Object o)
Follows the same general contract as
Map.equals(Object). |
K |
firstKey() |
void |
forEachKeyValue(Procedure2<? super K,? super V> procedure)
Calls the
procedure with each key-value pair of the map. |
V |
get(Object key) |
int |
hashCode()
Follows the same general contract as
Map.hashCode(). |
MutableSortedMap<K,V> |
headMap(K toKey) |
boolean |
isEmpty()
Returns true if this iterable has zero items.
|
Iterator<V> |
iterator() |
MutableSet<K> |
keySet()
The underlying set for the keys is sorted in ascending order according to their natural ordering or a custom comparator.
|
K |
lastKey() |
MutableSortedMap<K,V> |
newEmpty()
Deprecated.
use
TreeSortedMap.newEmpty() instead (inlineable) |
PartitionMutableList<V> |
partitionWhile(Predicate<? super V> predicate)
Returns a Partition of the initial elements that satisfy the Predicate and the remaining elements.
|
V |
put(K key,
V value) |
void |
putAll(Map<? extends K,? extends V> map) |
V |
remove(Object key) |
V |
removeKey(K key)
Remove an entry from the map at the specified
key. |
int |
size()
Returns the number of items in this iterable.
|
MutableSortedMap<K,V> |
subMap(K fromKey,
K toKey) |
MutableSortedMap<K,V> |
tailMap(K fromKey) |
MutableSortedMap<K,V> |
take(int count)
Returns the first
count elements of the iterable
or all the elements in the iterable if count is greater than the length of
the iterable. |
MutableSortedMap<K,V> |
takeWhile(Predicate<? super V> predicate)
Returns the initial elements that satisfy the Predicate.
|
MutableSortedMap<K,V> |
toReversed()
Returns a new ReversibleIterable in reverse order.
|
String |
toString()
Returns a string representation of this collection.
|
MutableCollection<V> |
values() |
MutableSortedMap<K,V> |
with(Pair<K,V>... pairs) |
asReversed, asSynchronized, asUnmodifiable, collect, collectBoolean, collectByte, collectChar, collectDouble, collectFloat, collectIf, collectInt, collectKeysAndValues, collectLong, collectShort, collectValues, collectWith, corresponds, detectIndex, detectLastIndex, flatCollect, flip, forEach, forEachWithIndex, groupBy, groupByEach, indexOf, partition, partitionWith, reject, reject, rejectWith, reverseForEach, select, select, selectInstancesOf, selectWith, tap, toImmutable, toStack, withAllKeyValueArguments, withAllKeyValues, withKeyValue, withoutAllKeys, withoutKey, zip, zipWithIndexadd, aggregateBy, aggregateInPlaceBy, collect, detect, flipUniqueValues, getIfAbsentPut, getIfAbsentPut, getIfAbsentPutWith, getIfAbsentPutWithKey, groupByUniqueKey, keysView, keyValuesView, updateValue, updateValueWith, valuesViewallSatisfy, allSatisfyWith, anySatisfy, anySatisfyWith, asLazy, chunk, contains, detect, detectIfNone, detectWith, detectWithIfNone, each, forEachKey, forEachValue, forEachWith, forEachWithIndex, getFirst, getIfAbsent, getIfAbsentValue, getIfAbsentWith, getLast, ifPresentApply, noneSatisfy, noneSatisfyWith, toArray, toArrayappendString, appendString, appendString, collect, collectBoolean, collectByte, collectChar, collectDouble, collectFloat, collectIf, collectInt, collectLong, collectShort, collectWith, containsAll, containsAllArguments, containsAllIterable, count, countWith, flatCollect, forEach, groupBy, groupByEach, groupByUniqueKey, injectInto, injectInto, injectInto, injectInto, injectInto, makeString, makeString, makeString, max, max, maxBy, min, min, minBy, notEmpty, reject, rejectWith, select, selectWith, sumByDouble, sumByFloat, sumByInt, sumByLong, sumOfDouble, sumOfFloat, sumOfInt, sumOfLong, toBag, toList, toMap, toSet, toSortedBag, toSortedBag, toSortedBagBy, toSortedList, toSortedList, toSortedListBy, toSortedMap, toSortedMap, toSortedSet, toSortedSet, toSortedSetBy, zip, zipWithIndexaggregateBy, aggregateInPlaceBy, collect, getIfAbsentPutWith, groupByUniqueKeyadd, flipUniqueValues, getIfAbsentPut, getIfAbsentPut, getIfAbsentPutWithKey, updateValue, updateValueWithdetect, forEachKey, forEachValue, getIfAbsent, getIfAbsentValue, getIfAbsentWith, ifPresentApply, keysView, keyValuesView, valuesViewforEachWithIndex, getFirst, getLast, max, min, zip, zipWithIndexallSatisfy, allSatisfyWith, anySatisfy, anySatisfyWith, appendString, appendString, appendString, asLazy, chunk, collect, collectBoolean, collectByte, collectChar, collectDouble, collectFloat, collectIf, collectInt, collectLong, collectShort, collectWith, contains, containsAll, containsAllArguments, containsAllIterable, count, countWith, detect, detectIfNone, detectWith, detectWithIfNone, each, flatCollect, groupBy, groupByEach, groupByUniqueKey, injectInto, injectInto, injectInto, injectInto, injectInto, makeString, makeString, makeString, max, maxBy, min, minBy, noneSatisfy, noneSatisfyWith, notEmpty, reject, rejectWith, select, selectWith, sumByDouble, sumByFloat, sumByInt, sumByLong, sumOfDouble, sumOfFloat, sumOfInt, sumOfLong, toArray, toArray, toBag, toList, toMap, toSet, toSortedBag, toSortedBag, toSortedBagBy, toSortedList, toSortedList, toSortedListBy, toSortedMap, toSortedMap, toSortedSet, toSortedSet, toSortedSetByforEach, forEachWithforEach, spliteratorcompute, computeIfAbsent, computeIfPresent, forEach, getOrDefault, merge, putIfAbsent, remove, replace, replace, replaceAllpublic static <K,V> MutableSortedMap<K,V> adapt(SortedMap<K,V> map)
public void forEachKeyValue(Procedure2<? super K,? super V> procedure)
MapIterableprocedure with each key-value pair of the map.
final Collection<String> collection = new ArrayList<String>();
MutableMap<Integer, String> map = this.newMapWithKeysValues(1, "One", 2, "Two", 3, "Three");
map.forEachKeyValue(new Procedure2<Integer, String>()
{
public void value(final Integer key, final String value)
{
collection.add(String.valueOf(key) + value);
}
});
Verify.assertContainsAll(collection, "1One", "2Two", "3Three");
forEachKeyValue in interface MapIterable<K,V>@Deprecated public MutableSortedMap<K,V> newEmpty()
TreeSortedMap.newEmpty() instead (inlineable)MutableSortedMapnewEmpty in interface MutableMapIterable<K,V>newEmpty in interface MutableSortedMap<K,V>public boolean containsKey(Object key)
containsKey in interface Map<K,V>containsKey in interface MapIterable<K,V>Map.containsKey(Object)public boolean containsValue(Object value)
containsValue in interface Map<K,V>containsValue in interface MapIterable<K,V>Map.containsValue(Object)public Comparator<? super K> comparator()
comparator in interface SortedMap<K,V>comparator in interface SortedMapIterable<K,V>public int size()
RichIterablepublic boolean isEmpty()
RichIterableisEmpty in interface Map<K,V>isEmpty in interface RichIterable<V>isEmpty in class AbstractRichIterable<V>public MutableCollection<V> values()
public MutableSet<Map.Entry<K,V>> entrySet()
public MutableSet<K> keySet()
MutableSortedMappublic MutableSortedMap<K,V> headMap(K toKey)
public MutableSortedMap<K,V> tailMap(K fromKey)
public MutableSortedMap<K,V> subMap(K fromKey, K toKey)
public V get(Object key)
get in interface Map<K,V>get in interface MapIterable<K,V>Map.get(Object)public V removeKey(K key)
MutableMapIterablekey.removeKey in interface MutableMapIterable<K,V>Map.remove(Object)public MutableSortedMap<K,V> with(Pair<K,V>... pairs)
with in interface MutableSortedMap<K,V>with in class AbstractMutableSortedMap<K,V>public String toString()
AbstractRichIterable
This implementation creates an empty string buffer, appends a left square bracket, and iterates over the collection appending the string representation of each element in turn. After appending each element except the last, the string ", " is appended. Finally a right bracket is appended. A string is obtained from the string buffer, and returned.
toString in interface MapIterable<K,V>toString in interface RichIterable<V>toString in class AbstractRichIterable<V>public MutableSortedMap<K,V> clone()
clone in interface MutableSortedMap<K,V>clone in class AbstractMutableSortedMap<K,V>public boolean equals(Object o)
MapIterableMap.equals(Object).public int hashCode()
MapIterableMap.hashCode().public MutableSortedMap<K,V> toReversed()
ReversibleIterabletoReversed in interface MutableSortedMap<K,V>toReversed in interface SortedMapIterable<K,V>toReversed in interface ReversibleIterable<V>public MutableSortedMap<K,V> take(int count)
ReversibleIterablecount elements of the iterable
or all the elements in the iterable if count is greater than the length of
the iterable.take in interface MutableSortedMap<K,V>take in interface SortedMapIterable<K,V>take in interface ReversibleIterable<V>count - the number of items to take.public MutableSortedMap<K,V> takeWhile(Predicate<? super V> predicate)
ReversibleIterabletakeWhile in interface MutableSortedMap<K,V>takeWhile in interface SortedMapIterable<K,V>takeWhile in interface OrderedIterable<V>takeWhile in interface ReversibleIterable<V>public MutableSortedMap<K,V> drop(int count)
ReversibleIterablecount elements
or an empty iterable if the count is greater than the length of the iterable.drop in interface MutableSortedMap<K,V>drop in interface SortedMapIterable<K,V>drop in interface ReversibleIterable<V>count - the number of items to drop.public MutableSortedMap<K,V> dropWhile(Predicate<? super V> predicate)
ReversibleIterabledropWhile in interface MutableSortedMap<K,V>dropWhile in interface SortedMapIterable<K,V>dropWhile in interface OrderedIterable<V>dropWhile in interface ReversibleIterable<V>public PartitionMutableList<V> partitionWhile(Predicate<? super V> predicate)
OrderedIterablepartitionWhile in interface MutableSortedMap<K,V>partitionWhile in interface SortedMapIterable<K,V>partitionWhile in interface OrderedIterable<V>partitionWhile in interface ReversibleIterable<V>public MutableList<V> distinct()
OrderedIterableOrderedIterable containing the distinct elements in this iterable.
Conceptually similar to RichIterable.toSet().RichIterable.toList() but retains the original order. If an element appears
multiple times in this iterable, the first one will be copied into the result.
distinct in interface MutableSortedMap<K,V>distinct in interface SortedMapIterable<K,V>distinct in interface OrderedIterable<V>distinct in interface ReversibleIterable<V>OrderedIterable of distinct elementsCopyright © 2004–2016. All rights reserved.