Uses of Interface
org.apache.commons.collections4.IterableSortedMap

Packages that use IterableSortedMap

Package	Description
org.apache.commons.collections4	Interfaces and utilities shared across all packages.
org.apache.commons.collections4.bidimap	Implements the BidiMap, OrderedBidiMap and SortedBidiMap interfaces.
org.apache.commons.collections4.map	Implements the Map, IterableMap, OrderedMap and SortedMap interfaces.
org.apache.commons.collections4.trie	Implements the Trie interface.

Uses of IterableSortedMap in org.apache.commons.collections4

Subinterfaces of IterableSortedMap in org.apache.commons.collections4

Modifier and Type	Interface	Description
interface	Trie<K,V>	Defines the interface for a prefix tree, an ordered tree data structure.

Methods in org.apache.commons.collections4 that return IterableSortedMap

Modifier and Type	Method	Description
static <K, V> IterableSortedMap<K,V>	MapUtils.iterableSortedMap(SortedMap<K,V> sortedMap)	Gets the specified SortedMap as an IterableSortedMap.

Uses of IterableSortedMap in org.apache.commons.collections4.bidimap

Classes in org.apache.commons.collections4.bidimap that implement IterableSortedMap

Modifier and Type	Class	Description
protected static class	DualTreeBidiMap.ViewMap<K,V>	Internal sorted map view.

Uses of IterableSortedMap in org.apache.commons.collections4.map

Classes in org.apache.commons.collections4.map that implement IterableSortedMap

Modifier and Type	Class	Description
class	AbstractSortedMapDecorator<K,V>	Provides a base decorator that enables additional functionality to be added to a Map via decoration.
class	FixedSizeSortedMap<K,V>	Decorates another SortedMap to fix the size blocking add/remove.
final class	UnmodifiableSortedMap<K,V>	Decorates another SortedMap to ensure it can't be altered.

Uses of IterableSortedMap in org.apache.commons.collections4.trie

Classes in org.apache.commons.collections4.trie that implement IterableSortedMap

Modifier and Type	Class	Description
class	AbstractBitwiseTrie<K,V>	This class provides some basic Trie functionality and utility methods for actual bitwise Trie implementations.
class	AbstractPatriciaTrie<K,V>	This class implements the base PATRICIA algorithm and everything that is related to the Map interface.
class	PatriciaTrie<V>	Implements a PATRICIA Trie (Practical Algorithm to Retrieve Information Coded in Alphanumeric).
class	UnmodifiableTrie<K,V>	An unmodifiable Trie.