com.microsoft.rest.v2.http

Class ConcurrentMultiDequeMap<K,V>

java.lang.Object

com.microsoft.rest.v2.http.ConcurrentMultiDequeMap<K,V>

Type Parameters:

K - the key type

V - the value type

public class ConcurrentMultiDequeMap<K,V>
extends Object

A thread-safe multi map where the values for a certain key are FIFO organized.

Constructor Summary

Constructors

Constructor and Description
ConcurrentMultiDequeMap() Create a concurrent multi hash map.

Method Summary

Modifier and Type	Method and Description
boolean	containsKey(K key) Checks if there are values associated with a key in the multimap.
ConcurrentLinkedDeque<V>	get(K key) Returns the queue associated with the given key.
Set<K>	keys()
V	poll() Retrieves and removes one item from the multi map.
V	poll(K key) Retrieves the least recently used item in the deque for the given key.
V	pop() Retrieves and removes one item from the multi map.
V	pop(K key) Retrieves the most recently used item in the deque for the given key.
V	put(K key, V value) Add a new key value pair to the multimap.
boolean	remove(K key, V value) Removes a key value pair in the multimap.
int	size()
Set<V>	values()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

ConcurrentMultiDequeMap

public ConcurrentMultiDequeMap()

Create a concurrent multi hash map.

Method Detail

put

public V put(K key,
             V value)

Add a new key value pair to the multimap.

Parameters:

key - the key to put

value - the value to put

Returns:

the added value

get

public ConcurrentLinkedDeque<V> get(K key)

Returns the queue associated with the given key.

Parameters:

key - the key to query

Returns:

the queue associated with the key

poll

public V poll()

Retrieves and removes one item from the multi map. The item is from the least recently used key set.

Returns:

the item removed from the map

pop

public V pop()

Retrieves and removes one item from the multi map. The item is from the most recently used key set.

Returns:

the item removed from the map

poll

public V poll(K key)

Retrieves the least recently used item in the deque for the given key.

Parameters:

key - the key to poll an item

Returns:

the least recently used item for the key

pop

public V pop(K key)

Retrieves the most recently used item in the deque for the given key.

Parameters:

key - the key to poll an item

Returns:

the most recently used item for the key

size

public int size()

Returns:

the size of the multimap.

containsKey

public boolean containsKey(K key)

Checks if there are values associated with a key in the multimap.

Parameters:

key - the key to check

Returns:

true if there are values associated

keys

public Set<K> keys()

Returns:

the set of keys with which there are values associated

values

public Set<V> values()

Returns:

the set of all values for all keys in the multimap.

remove

public boolean remove(K key,
                      V value)

Removes a key value pair in the multimap. If there's no such key value pair then this returns false. Otherwise this method removes it and returns true.

Parameters:

key - the key to remove

value - the value to remove

Returns:

true if an item is removed