Uses of Class
org.eclipse.emf.common.util.WeakInterningHashSet.Entry
Packages that use WeakInterningHashSet.Entry
-
Uses of WeakInterningHashSet.Entry in org.eclipse.emf.common.util
Subclasses of WeakInterningHashSet.Entry in org.eclipse.emf.common.utilModifier and TypeClassDescriptionprotected static classprotected static classA specialized external entry managed by theexternal queuethat callsWeakInterningHashSet.SelfCleaningEntry.clear()to remove this entry from its set.Fields in org.eclipse.emf.common.util declared as WeakInterningHashSet.EntryModifier and TypeFieldDescriptionprotected WeakInterningHashSet.Entry<E>Pool.AccessUnit.createdEntryprotected WeakInterningHashSet.Entry<E>[]Pool.AccessUnit.entriesprotected WeakInterningHashSet.Entry<E>[]WeakInterningHashSet.entriesThe table of linked entries.WeakInterningHashSet.Entry.nextThe next entry in the collision chain.protected static final WeakInterningHashSet.Entry<Object>WeakInterningHashSet.NULL_ENTRYA special entry used by the iterator to represent the need to yield the null value for the subsequent call to next().Methods in org.eclipse.emf.common.util that return WeakInterningHashSet.EntryModifier and TypeMethodDescriptionprotected WeakInterningHashSet.Entry<E>Pool.AccessUnit.getEntry()protected WeakInterningHashSet.Entry<E>Pool.getEntry(int hashCode) Gets the first entry with the matching hash code.protected WeakInterningHashSet.Entry<E>WeakInterningHashSet.getEntry(int hashCode) Gets the first entry in the table with exactly the given hash code.final WeakInterningHashSet.Entry<E>WeakInterningHashSet.Entry.getNextEntry()Returns the next entry in the collision chain with the samehashCode.protected WeakInterningHashSet.Entry<E>[]WeakInterningHashSet.newEntries(int capacity) Creates a new array ofWeakInterningHashSet.entrieswith the specified capacity.protected final WeakInterningHashSet.Entry<E>Creates a new entry for the given referent and the given hash code.protected WeakInterningHashSet.Entry<E>Pool.newExternalEntry(E object, int hashCode) 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 theWeakInterningHashSet.externalQueue.protected WeakInterningHashSet.Entry<E>WeakInterningHashSet.newInternalEntry(E object, int hashCode) Creates a new entry for the given referent and the given hash code and theWeakInterningHashSet.internalQueue.protected WeakInterningHashSet.Entry<E>WeakInterningHashSet.nullEntry()Returns thesingleton entryrepresenting thenullvalue's entry during iteration.Methods in org.eclipse.emf.common.util with parameters of type WeakInterningHashSet.EntryModifier and TypeMethodDescriptionvoidPool.AccessUnit.add(E value, WeakInterningHashSet.Entry<E> entry) Add a value to thePool.AccessUnit.valuesincrementing thePool.AccessUnit.valuesLength.protected voidWeakInterningHashSet.addEntry(int index, WeakInterningHashSet.Entry<E> entry) Adds a new entry to the set at the given given index in theWeakInterningHashSet.entries.protected voidWeakInterningHashSet.putEntry(int index, WeakInterningHashSet.Entry<E> entry) Puts the entry into theWeakInterningHashSet.entrieslinking up thechainfor collision handling.final booleanPool.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 booleanWeakInterningHashSet.removeEntry(int index, WeakInterningHashSet.Entry<E> entry) Finds the entry at the given index thetableand prune if from the collision chain.protected voidWeakInterningHashSet.removeEntry(WeakInterningHashSet.Entry<E> entry) Removean existing entry from the set.