|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectorg.quartz.utils.DirtyFlagMap<K,V>
public class DirtyFlagMap<K,V>
An implementation of Map that wraps another Map
and flags itself 'dirty' when it is modified.
| Nested Class Summary |
|---|
| Nested classes/interfaces inherited from interface java.util.Map |
|---|
java.util.Map.Entry<K,V> |
| Constructor Summary | |
|---|---|
DirtyFlagMap()
Create a DirtyFlagMap that 'wraps' a HashMap. |
|
DirtyFlagMap(int initialCapacity)
Create a DirtyFlagMap that 'wraps' a HashMap that has the
given initial capacity. |
|
DirtyFlagMap(int initialCapacity,
float loadFactor)
Create a DirtyFlagMap that 'wraps' a HashMap that has the
given initial capacity and load factor. |
|
| Method Summary | |
|---|---|
void |
clear()
|
void |
clearDirtyFlag()
Clear the 'dirty' flag (set dirty flag to false). |
java.lang.Object |
clone()
|
boolean |
containsKey(java.lang.Object key)
|
boolean |
containsValue(java.lang.Object val)
|
java.util.Set<java.util.Map.Entry<K,V>> |
entrySet()
|
boolean |
equals(java.lang.Object obj)
|
V |
get(java.lang.Object key)
|
java.util.Map<K,V> |
getWrappedMap()
Get a direct handle to the underlying Map. |
int |
hashCode()
|
boolean |
isDirty()
Determine whether the Map is flagged dirty. |
boolean |
isEmpty()
|
java.util.Set<K> |
keySet()
|
V |
put(K key,
V val)
|
void |
putAll(java.util.Map<? extends K,? extends V> t)
|
V |
remove(java.lang.Object key)
|
int |
size()
|
java.util.Collection<V> |
values()
|
| Methods inherited from class java.lang.Object |
|---|
finalize, getClass, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public DirtyFlagMap()
Create a DirtyFlagMap that 'wraps' a HashMap.
HashMappublic DirtyFlagMap(int initialCapacity)
Create a DirtyFlagMap that 'wraps' a HashMap that has the
given initial capacity.
HashMap
public DirtyFlagMap(int initialCapacity,
float loadFactor)
Create a DirtyFlagMap that 'wraps' a HashMap that has the
given initial capacity and load factor.
HashMap| Method Detail |
|---|
public void clearDirtyFlag()
Clear the 'dirty' flag (set dirty flag to false).
public boolean isDirty()
Determine whether the Map is flagged dirty.
public java.util.Map<K,V> getWrappedMap()
Get a direct handle to the underlying Map.
public void clear()
clear in interface java.util.Map<K,V>public boolean containsKey(java.lang.Object key)
containsKey in interface java.util.Map<K,V>public boolean containsValue(java.lang.Object val)
containsValue in interface java.util.Map<K,V>public java.util.Set<java.util.Map.Entry<K,V>> entrySet()
entrySet in interface java.util.Map<K,V>public boolean equals(java.lang.Object obj)
equals in interface java.util.Map<K,V>equals in class java.lang.Objectpublic int hashCode()
hashCode in interface java.util.Map<K,V>hashCode in class java.lang.Objectpublic V get(java.lang.Object key)
get in interface java.util.Map<K,V>public boolean isEmpty()
isEmpty in interface java.util.Map<K,V>public java.util.Set<K> keySet()
keySet in interface java.util.Map<K,V>
public V put(K key,
V val)
put in interface java.util.Map<K,V>public void putAll(java.util.Map<? extends K,? extends V> t)
putAll in interface java.util.Map<K,V>public V remove(java.lang.Object key)
remove in interface java.util.Map<K,V>public int size()
size in interface java.util.Map<K,V>public java.util.Collection<V> values()
values in interface java.util.Map<K,V>public java.lang.Object clone()
clone in class java.lang.Object
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||