mirror of
https://github.com/apache/commons-collections.git
synced 2025-02-13 21:46:31 +00:00
Javadoc
This commit is contained in:
parent
94c4c7c667
commit
55b831050d
@ -26,7 +26,7 @@ import java.util.Map;
|
||||
import org.apache.commons.collections4.BidiMap;
|
||||
|
||||
/**
|
||||
* Implementation of {@link BidiMap} that uses two {@link HashMap} instances.
|
||||
* Implements {@link BidiMap} with two {@link HashMap} instances.
|
||||
* <p>
|
||||
* Two {@link HashMap} instances are used in this class.
|
||||
* This provides fast lookups at the expense of storing two sets of map entries.
|
||||
|
@ -26,7 +26,7 @@ import java.util.Map;
|
||||
import org.apache.commons.collections4.BidiMap;
|
||||
|
||||
/**
|
||||
* Implementation of {@link BidiMap} that uses two {@link LinkedHashMap} instances.
|
||||
* Implements {@link BidiMap} with two {@link LinkedHashMap} instances.
|
||||
* <p>
|
||||
* Two {@link LinkedHashMap} instances are used in this class.
|
||||
* This provides fast lookups at the expense of storing two sets of map entries and two linked lists.
|
||||
|
@ -37,7 +37,7 @@ import org.apache.commons.collections4.SortedBidiMap;
|
||||
import org.apache.commons.collections4.map.AbstractSortedMapDecorator;
|
||||
|
||||
/**
|
||||
* Implementation of {@link BidiMap} that uses two {@link TreeMap} instances.
|
||||
* Implements {@link BidiMap} with two {@link TreeMap} instances.
|
||||
* <p>
|
||||
* The setValue() method on iterators will succeed only if the new value being set is
|
||||
* not already in the bidi map.
|
||||
|
@ -48,7 +48,7 @@ abstract class AbstractInputCheckedMapDecorator<K, V>
|
||||
extends AbstractMapDecorator<K, V> {
|
||||
|
||||
/**
|
||||
* Implementation of an entry set that checks additions via setValue.
|
||||
* Implements an entry set that checks additions via setValue.
|
||||
*/
|
||||
private final class EntrySet extends AbstractSetDecorator<Map.Entry<K, V>> {
|
||||
|
||||
@ -107,7 +107,7 @@ abstract class AbstractInputCheckedMapDecorator<K, V>
|
||||
}
|
||||
|
||||
/**
|
||||
* Implementation of an entry set iterator that checks additions via setValue.
|
||||
* Implements an entry set iterator that checks additions via setValue.
|
||||
*/
|
||||
private final class EntrySetIterator extends AbstractIteratorDecorator<Map.Entry<K, V>> {
|
||||
|
||||
@ -128,7 +128,7 @@ abstract class AbstractInputCheckedMapDecorator<K, V>
|
||||
}
|
||||
|
||||
/**
|
||||
* Implementation of a map entry that checks additions via setValue.
|
||||
* Implements a map entry that checks additions via setValue.
|
||||
*/
|
||||
private final class MapEntry extends AbstractMapEntryDecorator<K, V> {
|
||||
|
||||
|
@ -43,7 +43,7 @@ public final class UnmodifiableEntrySet<K, V>
|
||||
extends AbstractSetDecorator<Map.Entry<K, V>> implements Unmodifiable {
|
||||
|
||||
/**
|
||||
* Implementation of a map entry that is unmodifiable.
|
||||
* Implements a map entry that is unmodifiable.
|
||||
*/
|
||||
private final class UnmodifiableEntry extends AbstractMapEntryDecorator<K, V> {
|
||||
|
||||
@ -58,7 +58,7 @@ public final class UnmodifiableEntrySet<K, V>
|
||||
}
|
||||
|
||||
/**
|
||||
* Implementation of an entry set iterator.
|
||||
* Implements an entry set iterator.
|
||||
*/
|
||||
private final class UnmodifiableEntrySetIterator extends AbstractIteratorDecorator<Map.Entry<K, V>> {
|
||||
|
||||
|
@ -21,7 +21,7 @@ import java.util.Map;
|
||||
import org.apache.commons.collections4.trie.analyzer.StringKeyAnalyzer;
|
||||
|
||||
/**
|
||||
* Implementation of a PATRICIA Trie (Practical Algorithm to Retrieve Information
|
||||
* Implements a PATRICIA Trie (Practical Algorithm to Retrieve Information
|
||||
* Coded in Alphanumeric).
|
||||
* <p>
|
||||
* A PATRICIA {@link org.apache.commons.collections4.Trie} is a compressed
|
||||
|
Loading…
x
Reference in New Issue
Block a user