IndexedSet (dxlib 3.341)

java.lang.Object
- com.devexperts.util.AbstractConcurrentSet<V>
- - com.devexperts.util.IndexedSet<K,V>

All Implemented Interfaces:

Serializable, Cloneable, Iterable<V>, Collection<V>, Set<V>

Direct Known Subclasses:

SynchronizedIndexedSet
```
public class IndexedSet<K,V>
extends AbstractConcurrentSet<V>
implements Cloneable, Serializable
```
A collection that contains no duplicate elements according to specified identification strategy. The IndexedSet class implements and obeys general contracts of Set interface and provides additional benefits over standard implementations:
- delegation of element identification to external strategy
- concurrent asynchronous read access
- safe publication of added values
- smaller memory footprint and faster performance
The IndexedSet assumes that identity of an element can be represented by a variable number of attributes, therefore it delegates identification to an external strategy — the IndexerFunction. In order to fulfil contracts of Map interface and for convenience, the IndexedSet supports concept of explicit key object and also numeric key representation, but these identification means are optional and need not be supported by all strategies.
Note that the IndexedSet is not synchronized! Concurrent modifications of IndexedSet from multiple threads must be synchronized externally to preserve data integrity. On the other side, the IndexedSet fully supports concurrent asynchronous read operations, which works during concurrent modification by other thread. In case of concurrent modification each atomic read sees IndexedSet either before or after each atomic write operation.
The IndexedSet does not support null values, but it supports null keys if they are supported by corresponding IndexerFunction. The IndexedSet is serializable.
See Also:

Serialized Form

Constructor Summary

Constructors
Modifier	Constructor and Description
	`IndexedSet()` Creates new empty set with default indexer `IndexerFunction.DEFAULT`.
	`IndexedSet(Collection<V> c)` Creates a new set containing the elements in the specified collection.
	`IndexedSet(Indexer<K,? super V> indexer)` Deprecated. Use `create(indexer)`
	`IndexedSet(Indexer<K,? super V> indexer, Collection<? extends V> c)` Deprecated. Use `create(indexer)`.`withElements(c)`
	`IndexedSet(Indexer<K,? super V> indexer, int initialCapacity)` Deprecated. Use `create(indexer)`.`withCapacity(initialCapacity)`
`protected`	`IndexedSet(IndexerFunction<K,? super V> indexer)` Creates new empty set with specified indexer.
`protected`	`IndexedSet(IndexerFunction<K,? super V> indexer, Collection<? extends V> c)` Creates a new set with specified indexer containing the elements in the specified collection.
`protected`	`IndexedSet(IndexerFunction<K,? super V> indexer, int initialCapacity)` Creates new empty set with specified indexer and specified initial capacity.
	`IndexedSet(int initialCapacity)` Creates new empty set with default indexer `IndexerFunction.DEFAULT` and specified initial capacity.

Method Summary

All Methods Static Methods Instance Methods Concrete Methods Deprecated Methods
Modifier and Type	Method and Description
`boolean`	`add(V value)` Adds specified element into this set and returns true if this operation has increased the size of this set.
`void`	`clear()` Removes all elements from this set.
`IndexedSet<K,V>`	`clone()` Returns a shallow copy of this set - the values themselves are not cloned.
`static <V> Collector<V,?,? extends IndexedSet<V,V>>`	`collector()` Returns a `Collector` that accumulates the input elements into a new `IndexedSet` with default indexer.
`static <V> Collector<V,?,? extends IndexedSet<Integer,V>>`	`collector(IndexerFunction.IntKey<? super V> indexer)` Deprecated. Use `collectorInt(indexer)`
`static <V> Collector<V,?,? extends IndexedSet<Long,V>>`	`collector(IndexerFunction.LongKey<? super V> indexer)` Deprecated. Use `collectorLong(indexer)`
`static <K,V> Collector<V,?,? extends IndexedSet<K,V>>`	`collector(IndexerFunction<K,? super V> indexer)` Returns a `Collector` that accumulates the input elements into a new `IndexedSet` with specified indexer.
`static <V> Collector<V,?,? extends IndexedSet<V,V>>`	`collectorIdentity()` Returns a `Collector` that accumulates the input elements into a new `IndexedSet` with default identity indexer.
`static <K,V> Collector<V,?,? extends IndexedSet<K,V>>`	`collectorIdentity(IndexerFunction.IdentityKey<K,? super V> indexer)` Returns a `Collector` that accumulates the input elements into a new `IndexedSet` with specified identity indexer.
`static <V> Collector<V,?,? extends IndexedSet<Integer,V>>`	`collectorInt(IndexerFunction.IntKey<? super V> indexer)` Returns a `Collector` that accumulates the input elements into a new `IndexedSet` with specified int indexer.
`static <V> Collector<V,?,? extends IndexedSet<Long,V>>`	`collectorLong(IndexerFunction.LongKey<? super V> indexer)` Returns a `Collector` that accumulates the input elements into a new `IndexedSet` with specified long indexer.
`Iterator<V>`	`concurrentIterator()` Returns concurrent iterator over the elements in this set.
`boolean`	`contains(Object value)` Deprecated. Use `containsValue(V)` to be explicit about type and intent.
`boolean`	`containsKey(int key)` Returns true if this set contains element which matches specified key.
`boolean`	`containsKey(K key)` Returns true if this set contains element which matches specified key.
`boolean`	`containsKey(long key)` Returns true if this set contains element which matches specified key.
`boolean`	`containsValue(V value)` Returns true if this set contains element which matches specified value.
`static <V> IndexedSet<V,V>`	`create()` Creates new empty set with default indexer `IndexerFunction.DEFAULT`.
`static <V> IndexedSet<Integer,V>`	`create(IndexerFunction.IntKey<? super V> indexer)` Deprecated. Use `createInt(indexer)`
`static <V> IndexedSet<Integer,V>`	`create(IndexerFunction.IntKey<? super V> indexer, Collection<? extends V> c)` Deprecated. Use `createInt(indexer)`.`withElements(c)`
`static <V> IndexedSet<Integer,V>`	`create(IndexerFunction.IntKey<? super V> indexer, int initialCapacity)` Deprecated. Use `createInt(indexer)`.`withCapacity(initialCapacity)`
`static <V> IndexedSet<Long,V>`	`create(IndexerFunction.LongKey<? super V> indexer)` Deprecated. Use `createLong(indexer)`
`static <V> IndexedSet<Long,V>`	`create(IndexerFunction.LongKey<? super V> indexer, Collection<? extends V> c)` Deprecated. Use `createLong(indexer)`.`withElements(c)`
`static <V> IndexedSet<Long,V>`	`create(IndexerFunction.LongKey<? super V> indexer, int initialCapacity)` Deprecated. Use `createLong(indexer)`.`withCapacity(initialCapacity)`
`static <K,V> IndexedSet<K,V>`	`create(IndexerFunction<K,? super V> indexer)` Creates new empty set with specified indexer.
`static <K,V> IndexedSet<K,V>`	`create(IndexerFunction<K,? super V> indexer, Collection<? extends V> c)` Deprecated. Use `create(indexer)`.`withElements(c)`
`static <K,V> IndexedSet<K,V>`	`create(IndexerFunction<K,? super V> indexer, int initialCapacity)` Deprecated. Use `create(indexer)`.`withCapacity(initialCapacity)`
`static <V> IndexedSet<V,V>`	`createIdentity()` Creates new empty set with default identity indexer.
`static <K,V> IndexedSet<K,V>`	`createIdentity(IndexerFunction.IdentityKey<K,? super V> indexer)` Creates new empty set with specified identity indexer.
`static <V> IndexedSet<Integer,V>`	`createInt(IndexerFunction.IntKey<? super V> indexer)` Creates new empty set with specified int indexer.
`static <V> IndexedSet<Long,V>`	`createLong(IndexerFunction.LongKey<? super V> indexer)` Creates new empty set with specified long indexer.
`void`	`ensureCapacity(int capacity)` Increases the capacity of this set instance, if necessary, to ensure that it can hold at least the number of elements specified by the capacity argument.
`Iterator<Map.Entry<K,V>>`	`entryIterator()` Returns an iterator over the entries in this set.
`V`	`getByKey(int key)` Returns the element from this set which matches specified key or null if none were found.
`V`	`getByKey(K key)` Returns the element from this set which matches specified key or null if none were found.
`V`	`getByKey(long key)` Returns the element from this set which matches specified key or null if none were found.
`V`	`getByValue(V value)` Returns the element from this set which matches specified value or null if none were found.
`Indexer<K,? super V>`	`getIndexer()` Deprecated. Use `getIndexerFunction()`
`IndexerFunction<K,? super V>`	`getIndexerFunction()` Returns indexer function used to distinguish and identify elements in this set.
`IndexedSetStats`	`getStats()` Returns static structure statistics of this set.
`Iterator<V>`	`iterator()` Returns an iterator over the elements in this set.
`Iterator<K>`	`keyIterator()` Returns an iterator over the keys of elements in this set.
`static <V> IndexedSet<V,V>`	`of(V... objs)` Creates a new set with default indexer containing specified elements.
`V`	`put(V value)` Puts specified element into this set and returns previous element that matches specified one.
`V`	`putIfAbsentAndGet(V value)` Puts specified element into this set if it is absent and returns current element in the set that matches specified one.
`boolean`	`remove(Object value)` Removes specified element from this set if it is present and returns true if this operation has decreased the size of this set.
`boolean`	`removeAll(Collection<?> c)` Removes all of the elements in the specified collection from this set and returns true if this operation has decreased the size of this set.
`V`	`removeKey(int key)` Removes the element from this set which matches specified key if it is present and returns removed element or null if none were found.
`V`	`removeKey(K key)` Removes the element from this set which matches specified key if it is present and returns removed element or null if none were found.
`V`	`removeKey(long key)` Removes the element from this set which matches specified key if it is present and returns removed element or null if none were found.
`V`	`removeValue(V value)` Removes the element from this set which matches specified value if it is present and returns removed element or null if none were found.
`boolean`	`retainAll(Collection<?> c)` Retains only the elements in this set that are contained in the specified collection.
`int`	`size()` Returns the number of elements in this set.
`Object[]`	`toArray()` Returns an array containing all of the elements in this set.
`<T> T[]`	`toArray(T[] a)` Returns an array containing all of the elements in this set whose runtime type is that of the specified array.
`void`	`trimToSize()` Trims the capacity of this set instance to be the set's current size.
`IndexedSet<K,V>`	`withCapacity(int capacity)` Increases the capacity of this set instance, if necessary, to ensure that it can hold at least the number of elements specified by the capacity argument.
`IndexedSet<K,V>`	`withElements(Collection<? extends V> c)` Adds all of the elements in the specified collection into this set.

Methods inherited from class com.devexperts.util.AbstractConcurrentSet
addAll, containsAll, equals, hashCode, isEmpty, toString

Methods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.util.Set
spliterator

Methods inherited from interface java.util.Collection
parallelStream, removeIf, stream

Methods inherited from interface java.lang.Iterable
forEach

- Constructor Detail
  - IndexedSet
```
public IndexedSet()
```
    Creates new empty set with default indexer IndexerFunction.DEFAULT.
  - IndexedSet
```
public IndexedSet(int initialCapacity)
```
    Creates new empty set with default indexer IndexerFunction.DEFAULT and specified initial capacity.
  - IndexedSet
```
protected IndexedSet(IndexerFunction<K,? super V> indexer)
```
    Creates new empty set with specified indexer.
  - IndexedSet
```
@Deprecated
public IndexedSet(Indexer<K,? super V> indexer)
```
    Deprecated. Use create(indexer)
    
    Creates new empty set with specified indexer.
  - IndexedSet
```
protected IndexedSet(IndexerFunction<K,? super V> indexer,
                     int initialCapacity)
```
    Creates new empty set with specified indexer and specified initial capacity.
  - IndexedSet
```
@Deprecated
public IndexedSet(Indexer<K,? super V> indexer,
                              int initialCapacity)
```
    Deprecated. Use create(indexer).withCapacity(initialCapacity)
    
    Creates new empty set with specified indexer and specified initial capacity.
  - IndexedSet
```
public IndexedSet(Collection<V> c)
```
    Creates a new set containing the elements in the specified collection. If specified collection is an IndexedSet, then new indexed set uses same indexer, otherwise it uses default indexer IndexerFunction.DEFAULT.
  - IndexedSet
```
protected IndexedSet(IndexerFunction<K,? super V> indexer,
                     Collection<? extends V> c)
```
    Creates a new set with specified indexer containing the elements in the specified collection.
  - IndexedSet
```
@Deprecated
public IndexedSet(Indexer<K,? super V> indexer,
                              Collection<? extends V> c)
```
    Deprecated. Use create(indexer).withElements(c)
    
    Creates a new set with specified indexer containing the elements in the specified collection.
- Method Detail
  - create
```
public static <V> IndexedSet<V,V> create()
```
    Creates new empty set with default indexer IndexerFunction.DEFAULT.
  - createIdentity
```
public static <V> IndexedSet<V,V> createIdentity()
```
    Creates new empty set with default identity indexer.
  - create
```
public static <K,V> IndexedSet<K,V> create(IndexerFunction<K,? super V> indexer)
```
    Creates new empty set with specified indexer.
  - createIdentity
```
public static <K,V> IndexedSet<K,V> createIdentity(IndexerFunction.IdentityKey<K,? super V> indexer)
```
    Creates new empty set with specified identity indexer.
  - createInt
```
public static <V> IndexedSet<Integer,V> createInt(IndexerFunction.IntKey<? super V> indexer)
```
    Creates new empty set with specified int indexer.
  - createLong
```
public static <V> IndexedSet<Long,V> createLong(IndexerFunction.LongKey<? super V> indexer)
```
    Creates new empty set with specified long indexer.
  - create
```
@Deprecated
public static <V> IndexedSet<Integer,V> create(IndexerFunction.IntKey<? super V> indexer)
```
    Deprecated. Use createInt(indexer)
    
    Creates new empty set with specified indexer.
  - create
```
@Deprecated
public static <V> IndexedSet<Long,V> create(IndexerFunction.LongKey<? super V> indexer)
```
    Deprecated. Use createLong(indexer)
    
    Creates new empty set with specified indexer.
  - create
```
@Deprecated
public static <K,V> IndexedSet<K,V> create(IndexerFunction<K,? super V> indexer,
                                                       int initialCapacity)
```
    Deprecated. Use create(indexer).withCapacity(initialCapacity)
    
    Creates new empty set with specified indexer and specified initial capacity.
  - create
```
@Deprecated
public static <V> IndexedSet<Integer,V> create(IndexerFunction.IntKey<? super V> indexer,
                                                           int initialCapacity)
```
    Deprecated. Use createInt(indexer).withCapacity(initialCapacity)
    
    Creates new empty set with specified indexer and specified initial capacity.
  - create
```
@Deprecated
public static <V> IndexedSet<Long,V> create(IndexerFunction.LongKey<? super V> indexer,
                                                        int initialCapacity)
```
    Deprecated. Use createLong(indexer).withCapacity(initialCapacity)
    
    Creates new empty set with specified indexer and specified initial capacity.
  - create
```
@Deprecated
public static <K,V> IndexedSet<K,V> create(IndexerFunction<K,? super V> indexer,
                                                       Collection<? extends V> c)
```
    Deprecated. Use create(indexer).withElements(c)
    
    Creates a new set with specified indexer containing the elements in the specified collection.
  - create
```
@Deprecated
public static <V> IndexedSet<Integer,V> create(IndexerFunction.IntKey<? super V> indexer,
                                                           Collection<? extends V> c)
```
    Deprecated. Use createInt(indexer).withElements(c)
    
    Creates a new set with specified indexer containing the elements in the specified collection.
  - create
```
@Deprecated
public static <V> IndexedSet<Long,V> create(IndexerFunction.LongKey<? super V> indexer,
                                                        Collection<? extends V> c)
```
    Deprecated. Use createLong(indexer).withElements(c)
    
    Creates a new set with specified indexer containing the elements in the specified collection.
  - of
```
@SafeVarargs
public static <V> IndexedSet<V,V> of(V... objs)
```
    Creates a new set with default indexer containing specified elements.
  - collector
```
public static <V> Collector<V,?,? extends IndexedSet<V,V>> collector()
```
    Returns a Collector that accumulates the input elements into a new IndexedSet with default indexer. This is an unordered Collector.
  - collectorIdentity
```
public static <V> Collector<V,?,? extends IndexedSet<V,V>> collectorIdentity()
```
    Returns a Collector that accumulates the input elements into a new IndexedSet with default identity indexer. This is an unordered Collector.
  - collector
```
public static <K,V> Collector<V,?,? extends IndexedSet<K,V>> collector(IndexerFunction<K,? super V> indexer)
```
    Returns a Collector that accumulates the input elements into a new IndexedSet with specified indexer. This is an unordered Collector.
  - collectorIdentity
```
public static <K,V> Collector<V,?,? extends IndexedSet<K,V>> collectorIdentity(IndexerFunction.IdentityKey<K,? super V> indexer)
```
    Returns a Collector that accumulates the input elements into a new IndexedSet with specified identity indexer. This is an unordered Collector.
  - collectorInt
```
public static <V> Collector<V,?,? extends IndexedSet<Integer,V>> collectorInt(IndexerFunction.IntKey<? super V> indexer)
```
    Returns a Collector that accumulates the input elements into a new IndexedSet with specified int indexer. This is an unordered Collector.
  - collectorLong
```
public static <V> Collector<V,?,? extends IndexedSet<Long,V>> collectorLong(IndexerFunction.LongKey<? super V> indexer)
```
    Returns a Collector that accumulates the input elements into a new IndexedSet with specified long indexer. This is an unordered Collector.
  - collector
```
@Deprecated
public static <V> Collector<V,?,? extends IndexedSet<Integer,V>> collector(IndexerFunction.IntKey<? super V> indexer)
```
    Deprecated. Use collectorInt(indexer)
    
    Returns a Collector that accumulates the input elements into a new IndexedSet with specified indexer. This is an unordered Collector.
  - collector
```
@Deprecated
public static <V> Collector<V,?,? extends IndexedSet<Long,V>> collector(IndexerFunction.LongKey<? super V> indexer)
```
    Deprecated. Use collectorLong(indexer)
    
    Returns a Collector that accumulates the input elements into a new IndexedSet with specified indexer. This is an unordered Collector.
  - clone
```
public IndexedSet<K,V> clone()
```
    Returns a shallow copy of this set - the values themselves are not cloned.
    
    Overrides:
    
    clone in class Object
  - withCapacity
```
public IndexedSet<K,V> withCapacity(int capacity)
```
    Increases the capacity of this set instance, if necessary, to ensure that it can hold at least the number of elements specified by the capacity argument.
    Returns this set instance for convenience.
  - withElements
```
public IndexedSet<K,V> withElements(Collection<? extends V> c)
```
    Adds all of the elements in the specified collection into this set.
    Returns this set instance for convenience.
  - ensureCapacity
```
public void ensureCapacity(int capacity)
```
    Increases the capacity of this set instance, if necessary, to ensure that it can hold at least the number of elements specified by the capacity argument.
  - trimToSize
```
public void trimToSize()
```
    Trims the capacity of this set instance to be the set's current size. An application can use this operation to minimize the storage of this set instance.
  - clear
```
public void clear()
```
    Removes all elements from this set.
    
    Specified by:
    
    clear in interface Collection<V>
    
    Specified by:
    
    clear in interface Set<V>
    
    Overrides:
    
    clear in class AbstractConcurrentSet<V>
  - getIndexer
```
@Deprecated
public Indexer<K,? super V> getIndexer()
```
    Deprecated. Use getIndexerFunction()
    
    Returns indexer used to distinguish and identify elements in this set.
  - getIndexerFunction
```
public IndexerFunction<K,? super V> getIndexerFunction()
```
    Returns indexer function used to distinguish and identify elements in this set.
  - size
```
public int size()
```
    Returns the number of elements in this set.
    
    Specified by:
    
    size in interface Collection<V>
    
    Specified by:
    
    size in interface Set<V>
  - getByValue
```
public V getByValue(V value)
```
    Returns the element from this set which matches specified value or null if none were found.
  - getByKey
```
public V getByKey(K key)
```
    Returns the element from this set which matches specified key or null if none were found.
  - getByKey
```
public V getByKey(int key)
```
    Returns the element from this set which matches specified key or null if none were found.
  - getByKey
```
public V getByKey(long key)
```
    Returns the element from this set which matches specified key or null if none were found.
  - contains
```
public boolean contains(Object value)
```
    Deprecated. Use containsValue(V) to be explicit about type and intent.
    
    Returns true if this set contains element which matches specified value.
    This implementation delegates to (getByValue(value) != null) expression.
    Note, that unlike HashSet.contains(java.lang.Object), this method might throw ClassCastException if value is of the wrong class.
    
    Specified by:
    
    contains in interface Collection<V>
    
    Specified by:
    
    contains in interface Set<V>
  - containsValue
```
public boolean containsValue(V value)
```
    Returns true if this set contains element which matches specified value.
    This implementation delegates to (getByValue(value) != null) expression.
  - containsKey
```
public boolean containsKey(K key)
```
    Returns true if this set contains element which matches specified key.
    This implementation delegates to (getByKey(key) != null) expression.
  - containsKey
```
public boolean containsKey(int key)
```
    Returns true if this set contains element which matches specified key.
    This implementation delegates to (getByKey(key) != null) expression.
  - containsKey
```
public boolean containsKey(long key)
```
    Returns true if this set contains element which matches specified key.
    This implementation delegates to (getByKey(key) != null) expression.
  - iterator
```
@Nonnull
public Iterator<V> iterator()
```
    Returns an iterator over the elements in this set.
    
    Specified by:
    
    iterator in interface Iterable<V>
    
    Specified by:
    
    iterator in interface Collection<V>
    
    Specified by:
    
    iterator in interface Set<V>
  - keyIterator
```
public Iterator<K> keyIterator()
```
    Returns an iterator over the keys of elements in this set.
  - entryIterator
```
public Iterator<Map.Entry<K,V>> entryIterator()
```
    Returns an iterator over the entries in this set.
  - concurrentIterator
```
public Iterator<V> concurrentIterator()
```
    Returns concurrent iterator over the elements in this set.
  - toArray
```
@Nonnull
public Object[] toArray()
```
    Returns an array containing all of the elements in this set. Obeys the general contract of the Collection.toArray() method.
    
    Specified by:
    
    toArray in interface Collection<V>
    
    Specified by:
    
    toArray in interface Set<V>
    
    Overrides:
    
    toArray in class AbstractConcurrentSet<V>
  - toArray
```
@Nonnull
public <T> T[] toArray(T[] a)
```
    Returns an array containing all of the elements in this set whose runtime type is that of the specified array. Obeys the general contract of the Collection.toArray(Object[]) method.
    
    Specified by:
    
    toArray in interface Collection<V>
    
    Specified by:
    
    toArray in interface Set<V>
    
    Overrides:
    
    toArray in class AbstractConcurrentSet<V>
  - getStats
```
public IndexedSetStats getStats()
```
    Returns static structure statistics of this set.
  - put
```
public V put(V value)
```
    Puts specified element into this set and returns previous element that matches specified one.
  - putIfAbsentAndGet
```
public V putIfAbsentAndGet(V value)
```
    Puts specified element into this set if it is absent and returns current element in the set that matches specified one. This is equivalent to
```
   if (set.containsValue(value)) {
     return set.getByValue(value);
   } else {
     set.put(value);
     return value;
   }
 
```
    except that the action is performed atomically if it is properly synchronized.
    Note, that unlike ConcurrentMap.putIfAbsent(K, V), this method returns specified value (not null) if the value was absent.
  - add
```
public boolean add(V value)
```
    Adds specified element into this set and returns true if this operation has increased the size of this set.
    This implementation adds value using put(value) method.
    
    Specified by:
    
    add in interface Collection<V>
    
    Specified by:
    
    add in interface Set<V>
  - remove
```
public boolean remove(Object value)
```
    Removes specified element from this set if it is present and returns true if this operation has decreased the size of this set.
    This implementation removes value using removeValue(value) method.
    Note, that unlike HashSet.remove(java.lang.Object), this method might throw ClassCastException if value is of the wrong class.
    
    Specified by:
    
    remove in interface Collection<V>
    
    Specified by:
    
    remove in interface Set<V>
  - removeValue
```
public V removeValue(V value)
```
    Removes the element from this set which matches specified value if it is present and returns removed element or null if none were found.
  - removeKey
```
public V removeKey(K key)
```
    Removes the element from this set which matches specified key if it is present and returns removed element or null if none were found.
  - removeKey
```
public V removeKey(int key)
```
    Removes the element from this set which matches specified key if it is present and returns removed element or null if none were found.
  - removeKey
```
public V removeKey(long key)
```
    Removes the element from this set which matches specified key if it is present and returns removed element or null if none were found.
  - removeAll
```
public boolean removeAll(Collection<?> c)
```
    Removes all of the elements in the specified collection from this set and returns true if this operation has decreased the size of this set.
    Elements compared using the set's IndexerFunction.
    
    Specified by:
    
    removeAll in interface Collection<V>
    
    Specified by:
    
    removeAll in interface Set<V>
    
    Overrides:
    
    removeAll in class AbstractConcurrentSet<V>
    
    Parameters:
    
    c - collection containing elements to be removed from this set
    
    Returns:
    
    true if this set changed as a result of the call
  - retainAll
```
public boolean retainAll(Collection<?> c)
```
    Retains only the elements in this set that are contained in the specified collection.
    Elements compared using the set's IndexerFunction.
    NOTE: if provided collection is not an IndexedSet with the same IndexerFunction this implementation will create a temporary IndexedSet with provided elements.
    
    Specified by:
    
    retainAll in interface Collection<V>
    
    Specified by:
    
    retainAll in interface Set<V>
    
    Overrides:
    
    retainAll in class AbstractConcurrentSet<V>
    
    Parameters:
    
    c - collection containing elements to be retained in this set
    
    Returns:
    
    true if this set changed as a result of the call

Class IndexedSet<K,V>

Constructor Summary

Method Summary

Methods inherited from class com.devexperts.util.AbstractConcurrentSet

Methods inherited from class java.lang.Object

Methods inherited from interface java.util.Set

Methods inherited from interface java.util.Collection

Methods inherited from interface java.lang.Iterable

Constructor Detail

IndexedSet

IndexedSet

IndexedSet

IndexedSet

IndexedSet

IndexedSet

IndexedSet

IndexedSet

IndexedSet

Method Detail

create

createIdentity

create

createIdentity

createInt

createLong

create

create

create

create

create

create

create

create

of

collector

collectorIdentity

collector

collectorIdentity

collectorInt

collectorLong

collector

collector

clone

withCapacity

withElements

ensureCapacity

trimToSize

clear

getIndexer

getIndexerFunction

size

getByValue

getByKey

getByKey

getByKey

contains

containsValue

containsKey

containsKey

containsKey

iterator

keyIterator

entryIterator

concurrentIterator

toArray

toArray

getStats

put

putIfAbsentAndGet

add

remove

removeValue

removeKey

removeKey

removeKey

removeAll

retainAll