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

Packages that use IterableSortedMap
org.apache.commons.collections4 This package contains the interfaces and utilities shared across all the subpackages of this component. 
org.apache.commons.collections4.bidimap This package contains implementations of the BidiMap, OrderedBidiMap and SortedBidiMap interfaces. 
org.apache.commons.collections4.map This package contains implementations of the Map, IterableMap, OrderedMap and SortedMap interfaces. 
org.apache.commons.collections4.trie This package contains implementations of the Trie interface. 
 

Uses of IterableSortedMap in org.apache.commons.collections4
 

Subinterfaces of IterableSortedMap in org.apache.commons.collections4
 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
static
<K,V> IterableSortedMap<K,V>
MapUtils.iterableSortedMap(SortedMap<K,V> sortedMap)
          Get 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
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
 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.
 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
 class AbstractBitwiseTrie<K,V>
          This class provides some basic Trie functionality and utility methods for actual bitwise Trie implementations.
 class PatriciaTrie<E>
          Implementation of a PATRICIA Trie (Practical Algorithm to Retrieve Information Coded in Alphanumeric).
 class UnmodifiableTrie<K,V>
          An unmodifiable Trie.
 



Copyright © 2001–2013 The Apache Software Foundation. All rights reserved.