lac.contextnet.highlyscalablemap

Class HighlyScalableMap<K,V>

java.lang.Object

lac.contextnet.highlyscalablemap.HighlyScalableMap<K,V>

Type Parameters:

K - Key Type. It must implement Comparable interface and is recommended to implement HighlyScalableIndex interface

V - Value Type

All Implemented Interfaces:

java.util.Map<K,V>

public class HighlyScalableMap<K,V>
extends java.lang.Object
implements java.util.Map<K,V>

A High Scalable Map (TreeMap or HashMap) synchronized with read and write lockers

Author:

Rafael Oliveira Vasconcelos

Nested Class Summary

Nested classes/interfaces inherited from interface java.util.Map

java.util.Map.Entry<K,V>

Constructor Summary

Constructors

Constructor and Description
HighlyScalableMap() Constructs a HighlyScalableMap using a TreeMap, non-fair lock and default grain size (4)
HighlyScalableMap(boolean treeMap, boolean fairReadWriteLock, int initialHashCapacity, int lockGrainSize) Constructs a HighlyScalableMap
HighlyScalableMap(int lockGrainSize) Constructs a HighlyScalableMap using a TreeMap and non-fair lock

Method Summary

Methods

Modifier and Type	Method and Description
void	clear()
boolean	containsKey(java.lang.Object key)
boolean	containsValue(java.lang.Object value)
java.util.Set<java.util.Map.Entry<K,V>>	entrySet()
V	get(java.lang.Object key)
boolean	isEmpty()
java.util.Set<K>	keySet()
V	put(K key, V value)
void	putAll(java.util.Map<? extends K,? extends V> m)
V	remove(java.lang.Object key)
int	size()
java.util.Collection<V>	values()

Methods inherited from class java.lang.Object

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

Methods inherited from interface java.util.Map

equals, hashCode

Constructor Detail

HighlyScalableMap

public HighlyScalableMap()

Constructs a HighlyScalableMap using a TreeMap, non-fair lock and default grain size (4)

HighlyScalableMap

public HighlyScalableMap(int lockGrainSize)

Constructs a HighlyScalableMap using a TreeMap and non-fair lock

Parameters:

lockGrainSize - Number of Maps used

HighlyScalableMap

public HighlyScalableMap(boolean treeMap,
                 boolean fairReadWriteLock,
                 int initialHashCapacity,
                 int lockGrainSize)

Constructs a HighlyScalableMap

Parameters:

treeMap - TreeMap if true, otherwise HashMap

fairReadWriteLock - Fair lock if true, otherwise non-fair

initialHashCapacity - The initial HashMap capacity in case of treeMap = false

lockGrainSize - Number of Maps used

Method Detail

clear

public void clear()

Specified by:

clear in interface java.util.Map<K,V>

containsKey

public boolean containsKey(java.lang.Object key)

Specified by:

containsKey in interface java.util.Map<K,V>

containsValue

public boolean containsValue(java.lang.Object value)

Specified by:

containsValue in interface java.util.Map<K,V>

entrySet

public java.util.Set<java.util.Map.Entry<K,V>> entrySet()

Specified by:

entrySet in interface java.util.Map<K,V>

get

public V get(java.lang.Object key)

Specified by:

get in interface java.util.Map<K,V>

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface java.util.Map<K,V>

keySet

public java.util.Set<K> keySet()

Specified by:

keySet in interface java.util.Map<K,V>

put

public V put(K key,
    V value)

Specified by:

put in interface java.util.Map<K,V>

putAll

public void putAll(java.util.Map<? extends K,? extends V> m)

Specified by:

putAll in interface java.util.Map<K,V>

remove

public V remove(java.lang.Object key)

Specified by:

remove in interface java.util.Map<K,V>

size

public int size()

Specified by:

size in interface java.util.Map<K,V>

values

public java.util.Collection<V> values()

Specified by:

values in interface java.util.Map<K,V>