| Package | Description |
|---|---|
| org.eclipse.emf.common.util |
Provides basic utilities.
|
| Modifier and Type | Class and Description |
|---|---|
protected static class |
Pool.PoolEntry<E> |
protected static class |
WeakInterningHashSet.SelfCleaningEntry<E>
A specialized external entry managed by the
external queue that calls WeakInterningHashSet.SelfCleaningEntry.clear() to remove this entry from its set. |
| Modifier and Type | Field and Description |
|---|---|
protected WeakInterningHashSet.Entry<E> |
Pool.AccessUnit.createdEntry |
protected WeakInterningHashSet.Entry<E>[] |
WeakInterningHashSet.entries
The table of linked entries.
|
protected WeakInterningHashSet.Entry<E>[] |
Pool.AccessUnit.entries |
WeakInterningHashSet.Entry<E> |
WeakInterningHashSet.Entry.next
The next entry in the collision chain.
|
protected static WeakInterningHashSet.Entry<java.lang.Object> |
WeakInterningHashSet.NULL_ENTRY
A special entry used by the iterator to represent the need to yield the null value for the subsequent call to next().
|
| Modifier and Type | Method and Description |
|---|---|
protected WeakInterningHashSet.Entry<E> |
Pool.AccessUnit.getEntry() |
protected WeakInterningHashSet.Entry<E> |
WeakInterningHashSet.getEntry(int hashCode)
Gets the first entry in the table with exactly the given hash code.
|
protected WeakInterningHashSet.Entry<E> |
Pool.getEntry(int hashCode)
Gets the first entry with the matching hash code.
|
WeakInterningHashSet.Entry<E> |
WeakInterningHashSet.Entry.getNextEntry()
Returns the next entry in the collision chain with the same
hashCode. |
protected WeakInterningHashSet.Entry<E>[] |
WeakInterningHashSet.newEntries(int capacity)
Creates a new array of
WeakInterningHashSet.entries with the specified capacity. |
protected WeakInterningHashSet.Entry<E> |
WeakInterningHashSet.newEntry(E object,
int hashCode)
Creates a new entry for the given referent and the given hash code.
|
protected WeakInterningHashSet.Entry<E> |
WeakInterningHashSet.newExternalEntry(E object,
int hashCode)
Creates a new entry for the given referent and the given hash code managed by the
WeakInterningHashSet.externalQueue. |
protected WeakInterningHashSet.Entry<E> |
Pool.newExternalEntry(E object,
int hashCode) |
protected WeakInterningHashSet.Entry<E> |
WeakInterningHashSet.newInternalEntry(E object,
int hashCode)
Creates a new entry for the given referent and the given hash code and the
WeakInterningHashSet.internalQueue. |
protected WeakInterningHashSet.Entry<E> |
WeakInterningHashSet.nullEntry()
Returns the
singleton entry representing the null value's entry during iteration. |
| Modifier and Type | Method and Description |
|---|---|
void |
Pool.AccessUnit.add(E value,
WeakInterningHashSet.Entry<E> entry)
Add a value to the
Pool.AccessUnit.values incrementing the Pool.AccessUnit.valuesLength. |
protected void |
WeakInterningHashSet.addEntry(int index,
WeakInterningHashSet.Entry<E> entry)
Adds a new entry to the set at the given given index in the
WeakInterningHashSet.entries. |
protected void |
WeakInterningHashSet.putEntry(int index,
WeakInterningHashSet.Entry<E> entry)
Puts the entry into the
WeakInterningHashSet.entries linking up the chain for collision handling. |
boolean |
Pool.AccessUnit.rematches(E value,
WeakInterningHashSet.Entry<E> entry)
Used to determine whether the given value from the pool is equal to the value being accessed.
|
protected boolean |
WeakInterningHashSet.removeEntry(int index,
WeakInterningHashSet.Entry<E> entry)
Finds the entry at the given index the
table and prune if from the collision chain. |
protected void |
WeakInterningHashSet.removeEntry(WeakInterningHashSet.Entry<E> entry)
Remove an existing entry from the set. |
Copyright © 2018. Licensed under the Eclipse Public License v1.0. All rights reserved.
Submit a bug or feature