Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV CLASS NEXT CLASS | FRAMES NO FRAMES
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD

## org.dom4j.tree
Class ConcurrentReaderHashMap.Entry

    java.lang.Object
      org.dom4j.tree.ConcurrentReaderHashMap.Entry

All Implemented Interfaces:
  Map.Entry

Enclosing class:
  org.dom4j.tree.ConcurrentReaderHashMap

protected static class ConcurrentReaderHashMap.Entry
extends Object
implements Map.Entry

ConcurrentReaderHashMap collision list entry.

Field Summary
`protected int` | `hash`
`protected Object` | `key`
`protected ConcurrentReaderHashMap.Entry` | `next`
`protected Object` | `value`

Method Summary
`boolean` | `equals(Object o)`
`Object` | `getKey()`
`Object` | `getValue()` Get the value.
`int` | `hashCode()`
`Object` | `setValue(Object value)` Set the value of this entry.
`String` | `toString()`

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

Field Detail

### hash

    protected final int hash

### key

    protected final Object key

### next

    protected final ConcurrentReaderHashMap.Entry next

### value

    protected volatile Object value

Method Detail

### getKey

    public Object getKey()

  Specified by:
    `getKey` in interface `Map.Entry`

### getValue

    public Object getValue()

  Get the value. Note: In an entrySet or entrySet.iterator, unless the set or iterator is used under synchronization of the table as a whole (or you can otherwise guarantee lack of concurrent modification), `getValue` might return null, reflecting the fact that the entry has been concurrently removed. However, there are no assurances that concurrent removals will be reflected using this method.

  Specified by:
    `getValue` in interface `Map.Entry`
  Returns:
    the current value, or null if the entry has been detectably removed.

### setValue

    public Object setValue(Object value)

  Set the value of this entry. Note: In an entrySet or entrySet.iterator), unless the set or iterator is used under synchronization of the table as a whole (or you can otherwise guarantee lack of concurrent modification), `setValue` is not strictly guaranteed to actually replace the value field obtained via the `get` operation of the underlying hash table in multithreaded applications. If iterator-wide synchronization is not used, and any other concurrent `put` or `remove` operations occur, sometimes even to other entries, then this change is not guaranteed to be reflected in the hash table. (It might, or it might not. There are no assurances either way.)

  Specified by:
    `setValue` in interface `Map.Entry`
  Parameters:
    `value` - the new value.
  Returns:
    the previous value, or null if entry has been detectably removed.
  Throws:
    `NullPointerException` - if the value is `null`.

### equals

    public boolean equals(Object o)

  Specified by:
    `equals` in interface `Map.Entry`

### hashCode

    public int hashCode()

  Specified by:
    `hashCode` in interface `Map.Entry`

### toString

    public String toString()

Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV CLASS NEXT CLASS | FRAMES NO FRAMES
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD

Copyright © 2001-2005 MetaStuff Ltd.. All Rights Reserved.