K
- the key typeV
- the value typepublic class LinkedHashMultimap<K,V> extends AbstractMultimap<K,V>
Multimap
implementation that uses an LinkedHashSet
to store the values associated with a key. This
implementation does not allow duplicates and the values are ordered.AbstractMultimap.EntriesCollection, AbstractMultimap.EntryIterator, AbstractMultimap.ValueIterator, AbstractMultimap.ValuesCollection, AbstractMultimap.WrappedCollection, AbstractMultimap.WrappedKeySet, AbstractMultimap.WrappedList, AbstractMultimap.WrappedMap, AbstractMultimap.WrappedSortedKeySet
Modifier | Constructor and Description |
---|---|
protected |
LinkedHashMultimap() |
Modifier and Type | Method and Description |
---|---|
static <K,V> LinkedHashMultimap<K,V> |
create()
Creates a new, empty
LinkedHashMultimap (that allows no duplicates) with the default initial capacity. |
protected Collection<V> |
createCollection() |
protected Collection<V> |
createUnmodifiableEmptyCollection() |
asMap, clear, containsEntry, containsKey, containsValue, createEntryIterator, createUnmodifiable, entries, equals, get, getOrCreateCollection, hashCode, isEmpty, keySet, put, rawData, remove, removeAll, removeAllValuesForKey, size, toString, values, wrapCollection, wrapKeySet, wrapList, wrapMap
public static <K,V> LinkedHashMultimap<K,V> create()
LinkedHashMultimap
(that allows no duplicates) with the default initial capacity.K
- the key typeV
- the value typeprotected Collection<V> createCollection()
createCollection
in class AbstractMultimap<K,V>
protected Collection<V> createUnmodifiableEmptyCollection()
createUnmodifiableEmptyCollection
in class AbstractMultimap<K,V>
Copyright © 2008–2016 JBoss, a division of Red Hat. All rights reserved.