public class TreeMap<K,T> extends Object implements HugeMap<K,T>, Serializable
| Modifier and Type | Field and Description |
|---|---|
static float |
DEFAULT_CLEAR_FACTOR_ELEMENT |
static float |
DEFAULT_CLEAR_FACTOR_NODE |
static float |
DEFAULT_FRAGMENT_FACTOR_ELEMENT |
static float |
DEFAULT_FRAGMENT_FACTOR_NODE |
static int |
DEFAULT_MAX_CAPACITY_ELEMENT |
static int |
DEFAULT_MAX_CAPACITY_NODE |
| Constructor and Description |
|---|
TreeMap()
Cria uma nova instância usando os valores padrão.
|
TreeMap(String id,
int maxCapacityNodes,
double clearFactorNodes,
double fragmentFactorNodes,
Swapper swapNodes,
int quantitySwaperThreadNodes,
int subListsNodes,
int maxCapacityElements,
double clearFactorElements,
double fragmentFactorElements,
Swapper swapElements,
int quantitySwaperThreadElements,
int subListsElements,
TreeNodes<T> treeNodes) |
| Modifier and Type | Method and Description |
|---|---|
void |
clear() |
boolean |
containsKey(Object key) |
boolean |
containsValue(Object value) |
void |
destroy() |
Set<Map.Entry<K,T>> |
entrySet() |
void |
flush() |
T |
get(Object key) |
boolean |
isDeleteOnExit() |
boolean |
isEmpty() |
boolean |
isReadOnly() |
Set<K> |
keySet() |
T |
put(K key,
T element) |
void |
putAll(Map<? extends K,? extends T> m) |
T |
putIfAbsent(K key,
T element) |
T |
remove(Object key) |
boolean |
remove(Object key,
Object oldValue) |
T |
replace(K key,
T element) |
boolean |
replace(K key,
T oldElement,
T element) |
void |
setDeleteOnExit(boolean value) |
void |
setReadOnly(boolean value) |
int |
size() |
Collection<T> |
values() |
public static final int DEFAULT_MAX_CAPACITY_NODE
public static final float DEFAULT_CLEAR_FACTOR_NODE
public static final float DEFAULT_FRAGMENT_FACTOR_NODE
public static final int DEFAULT_MAX_CAPACITY_ELEMENT
public static final float DEFAULT_CLEAR_FACTOR_ELEMENT
public static final float DEFAULT_FRAGMENT_FACTOR_ELEMENT
public TreeMap()
public TreeMap(String id, int maxCapacityNodes, double clearFactorNodes, double fragmentFactorNodes, Swapper swapNodes, int quantitySwaperThreadNodes, int subListsNodes, int maxCapacityElements, double clearFactorElements, double fragmentFactorElements, Swapper swapElements, int quantitySwaperThreadElements, int subListsElements, TreeNodes<T> treeNodes)
public boolean replace(K key, T oldElement, T element)
replace in interface ConcurrentMap<K,T>public T putIfAbsent(K key, T element)
putIfAbsent in interface ConcurrentMap<K,T>public void setDeleteOnExit(boolean value)
setDeleteOnExit in interface HugeMap<K,T>public boolean isDeleteOnExit()
isDeleteOnExit in interface HugeMap<K,T>public boolean containsKey(Object key)
containsKey in interface Map<K,T>public boolean containsValue(Object value)
containsValue in interface Map<K,T>public boolean remove(Object key, Object oldValue)
remove in interface ConcurrentMap<K,T>public void setReadOnly(boolean value)
setReadOnly in interface HugeMap<K,T>public boolean isReadOnly()
isReadOnly in interface HugeMap<K,T>Copyright © 2016. All rights reserved.