Modifier and Type	Class and Description
private static class	StrongInternPool.ByteArrayInternPool
private static class	StrongInternPool.FieldInternPool
private class	StrongInternPool.IdentityHashSetIterator
public class	StrongInternPool.Index
private static class	StrongInternPool.MethodInternPool
private static class	StrongInternPool.RecordComponentInternPool
private static class	StrongInternPool.StringInternPool
private static class	StrongInternPool.TypeArrayInternPool
private static class	StrongInternPool.TypeInternPool

Field Summary

Modifier and Type	Field and Description
private static final int	DEFAULT_CAPACITY Same default as HashMap, must be a power of 2
private static final float	DEFAULT_LOAD_FACTOR 67%, just like IdentityHashMap
private final Class<E>	elementType The class of values that may be present in `table`.
private transient StrongInternPool<E>.Index	index Cache for an index
private final float	loadFactor The user defined load factor which defines when to resize
private static final int	MAXIMUM_CAPACITY MAX_INT - 1
private transient int	modCount Counter used to detect changes made outside of an iterator
private static final Object	NULL Marks null keys.
private static final long	serialVersionUID Serialization ID
private transient int	size The current number of key-value pairs
private transient Object[]	table The open-addressed table Must be `Object[]` instead of `E[]` to allow storing the `NULL` marker.
private transient int	threshold The next resize

Constructor Summary

Access	Constructor and Description
pack-priv	StrongInternPool(Class<E> elementType, int initialCapacity, float loadFactor)
pack-priv	StrongInternPool(Class<E> elementType, int initialCapacity)
pack-priv	StrongInternPool(Class<E> elementType)

Method Summary

Modifier and Type	Method and Description
public void	clear()
public StrongInternPool<E>	clone() Overrides java.lang.Object.clone. Creates and returns a copy of this object.
public boolean	contains(Object entry)
pack-priv boolean	eq(Object o1, Object o2)
pack-priv abstract boolean	equality(E o1, E o2)
pack-priv static StrongInternPool<byte[]>	forByteArrays()
pack-priv static StrongInternPool<FieldInternal>	forFields()
pack-priv static StrongInternPool<MethodInternal>	forMethods()
pack-priv static StrongInternPool<RecordComponentInternal>	forRecordComponents()
pack-priv static StrongInternPool<String>	forStrings()
pack-priv static StrongInternPool<Type[]>	forTypeArrays()
pack-priv static StrongInternPool<Type>	forTypes()
pack-priv int	hash(Object o)
pack-priv abstract int	hashCode(E o)
private static int	index(int hashCode, int length)
public StrongInternPool<E>.Index	index()
private void	init(int initialCapacity, float loadFactor)
public E	Returns: the one true unique object (equal to `entry`) intern(E the object to internalize entry) Internalizes the specified object by always returning the first ever stored.
public boolean	isEmpty()
public Iterator<E>	iterator()
private static <K> K	maskNull(K key)
pack-priv boolean	mayContain(Object o)
private int	nextIndex(int index, int length)
private int	offset(Object entry)
public void	printDebugStats()
private void	putForCreate(E entry)
private void	readObject(ObjectInputStream s)
private void	relocate(int start)
public boolean	remove(Object o)
private void	resize(int from)
public int	size()
public Object[]	Returns: an array containing elements in this set along with randomly placed nulls, toInternalArray() Advanced method that returns the internal table.
public String	toString() Overrides java.lang.Object.toString. Returns a string representation of the object.
private static <K> K	unmaskNull(K key)
private void	writeObject(ObjectOutputStream s)

Inherited from java.lang.Object:: equals finalize getClass hashCode notify notifyAll wait wait wait

Field Detail

DEFAULT_CAPACITY	back to summary
private static final int DEFAULT_CAPACITY Same default as HashMap, must be a power of 2

DEFAULT_LOAD_FACTOR	back to summary
private static final float DEFAULT_LOAD_FACTOR 67%, just like IdentityHashMap

elementType	back to summary
private final Class<E> elementType The class of values that may be present in `table`.

index	back to summary
private transient StrongInternPool<E>.Index index Cache for an index

loadFactor	back to summary
private final float loadFactor The user defined load factor which defines when to resize

MAXIMUM_CAPACITY	back to summary
private static final int MAXIMUM_CAPACITY MAX_INT - 1

modCount	back to summary
private transient int modCount Counter used to detect changes made outside of an iterator

NULL	back to summary
private static final Object NULL Marks null keys.

serialVersionUID	back to summary
private static final long serialVersionUID Serialization ID

size	back to summary
private transient int size The current number of key-value pairs

table back to summary

table	back to summary
private transient Object[] table The open-addressed table Must be `Object[]` instead of `E[]` to allow storing the `NULL` marker.

private transient Object[] table

The open-addressed table

Must be Object[] instead of E[] to allow storing the NULL marker.

threshold	back to summary
private transient int threshold The next resize

Constructor Detail

StrongInternPool	back to summary
pack-priv StrongInternPool(Class<E> elementType, int initialCapacity, float loadFactor)

StrongInternPool	back to summary
pack-priv StrongInternPool(Class<E> elementType, int initialCapacity)

StrongInternPool	back to summary
pack-priv StrongInternPool(Class<E> elementType)

Method Detail

clear	back to summary
public void clear()

clone back to summary

clone	back to summary
public StrongInternPool<E> clone() Overrides java.lang.Object.clone. Doc from java.lang.Object.clone. Creates and returns a copy of this object. The precise meaning of "copy" may depend on the class of the object. The general intent is that, for any object `x`, the expression: x.clone() != x will be true, and that the expression: x.clone().getClass() == x.getClass() will be `true`, but these are not absolute requirements. While it is typically the case that: x.clone().equals(x) will be `true`, this is not an absolute requirement. By convention, the returned object should be obtained by calling `super.clone`. If a class and all of its superclasses (except `Object`) obey this convention, it will be the case that `x.clone().getClass() == x.getClass()`. By convention, the object returned by this method should be independent of this object (which is being cloned). To achieve this independence, it may be necessary to modify one or more fields of the object returned by `super.clone` before returning it. Typically, this means copying any mutable objects that comprise the internal "deep structure" of the object being cloned and replacing the references to these objects with references to the copies. If a class contains only primitive fields or references to immutable objects, then it is usually the case that no fields in the object returned by `super.clone` need to be modified. Returns:StrongInternPool<E> a clone of this instance. Annotations @SuppressWarnings:unchecked

public StrongInternPool<E> clone()

Overrides java.lang.Object.clone.

Doc from java.lang.Object.clone.

Creates and returns a copy of this object. The precise meaning of "copy" may depend on the class of the object. The general intent is that, for any object x, the expression:

x.clone() != x

will be true, and that the expression:

x.clone().getClass() == x.getClass()

will be true, but these are not absolute requirements. While it is typically the case that:

x.clone().equals(x)

will be true, this is not an absolute requirement.

By convention, the returned object should be obtained by calling super.clone. If a class and all of its superclasses (except Object) obey this convention, it will be the case that x.clone().getClass() == x.getClass().

By convention, the object returned by this method should be independent of this object (which is being cloned). To achieve this independence, it may be necessary to modify one or more fields of the object returned by super.clone before returning it. Typically, this means copying any mutable objects that comprise the internal "deep structure" of the object being cloned and replacing the references to these objects with references to the copies. If a class contains only primitive fields or references to immutable objects, then it is usually the case that no fields in the object returned by super.clone need to be modified.

Returns:StrongInternPool<E>

a clone of this instance.

Annotations

@SuppressWarnings:unchecked

contains	back to summary
public boolean contains(Object entry)

eq	back to summary
pack-priv boolean eq(Object o1, Object o2) Annotations @SuppressWarnings:unchecked

equality	back to summary
pack-priv abstract boolean equality(E o1, E o2)

forByteArrays	back to summary
pack-priv static StrongInternPool<byte[]> forByteArrays()

forFields	back to summary
pack-priv static StrongInternPool<FieldInternal> forFields()

forMethods	back to summary
pack-priv static StrongInternPool<MethodInternal> forMethods()

forRecordComponents	back to summary
pack-priv static StrongInternPool<RecordComponentInternal> forRecordComponents()

forStrings	back to summary
pack-priv static StrongInternPool<String> forStrings()

forTypeArrays	back to summary
pack-priv static StrongInternPool<Type[]> forTypeArrays()

forTypes	back to summary
pack-priv static StrongInternPool<Type> forTypes()

hash	back to summary
pack-priv int hash(Object o) Annotations @SuppressWarnings:unchecked

hashCode	back to summary
pack-priv abstract int hashCode(E o)

index	back to summary
private static int index(int hashCode, int length)

index	back to summary
public StrongInternPool<E>.Index index()

init	back to summary
private void init(int initialCapacity, float loadFactor)

intern back to summary

intern	back to summary
public E intern(E entry) Internalizes the specified object by always returning the first ever stored. Equal objects with different identity (aka duplicates) can be eliminated with this method. Parameters entry:E the object to internalize Returns:E the one true unique object (equal to `entry`) Annotations @SuppressWarnings:unchecked

public E intern(E entry)

Internalizes the specified object by always returning the first ever stored. Equal objects with different identity (aka duplicates) can be eliminated with this method.

Parameters

entry:E: the object to internalize

Returns:E

the one true unique object (equal to entry)

Annotations

@SuppressWarnings:unchecked

isEmpty	back to summary
public boolean isEmpty()

iterator	back to summary
public Iterator<E> iterator()

maskNull	back to summary
private static <K> K maskNull(K key) Annotations @SuppressWarnings:unchecked

mayContain	back to summary
pack-priv boolean mayContain(Object o)

nextIndex	back to summary
private int nextIndex(int index, int length)

offset	back to summary
private int offset(Object entry)

printDebugStats	back to summary
public void printDebugStats()

putForCreate	back to summary
private void putForCreate(E entry)

readObject	back to summary
private void readObject(ObjectInputStream s) throws IOException, ClassNotFoundException Annotations @SuppressWarnings:unchecked

relocate	back to summary
private void relocate(int start)

remove	back to summary
public boolean remove(Object o)

resize	back to summary
private void resize(int from)

size	back to summary
public int size()

toInternalArray

Modifier and Type	Method and Description
pack-priv boolean	equality(byte[] o1, byte[] o2) Implements abstract org.jboss.jandex.StrongInternPool.equality.
pack-priv int	hashCode(byte[] o) Implements abstract org.jboss.jandex.StrongInternPool.hashCode.

Modifier and Type	Method and Description
pack-priv boolean	equality(FieldInternal o1, FieldInternal o2) Implements abstract org.jboss.jandex.StrongInternPool.equality.
pack-priv int	hashCode(FieldInternal o) Implements abstract org.jboss.jandex.StrongInternPool.hashCode.

Modifier and Type	Field and Description
private int	current
private int	expectedCount
private boolean	hasNext
private int	next
pack-priv Object[]	table

Modifier and Type	Method and Description
public boolean	hasNext() Implements java.util.Iterator.hasNext. Returns `true` if the iteration has more elements.
public E	next() Implements java.util.Iterator.next. Returns the next element in the iteration.
public void	remove() Overrides default java.util.Iterator.remove. Removes from the underlying collection the last element returned by this iterator (optional operation).

Modifier and Type	Method and Description
pack-priv boolean	equality(MethodInternal o1, MethodInternal o2) Implements abstract org.jboss.jandex.StrongInternPool.equality.
pack-priv int	hashCode(MethodInternal o) Implements abstract org.jboss.jandex.StrongInternPool.hashCode.

Modifier and Type	Method and Description
pack-priv boolean	equality(RecordComponentInternal o1, RecordComponentInternal o2) Implements abstract org.jboss.jandex.StrongInternPool.equality.
pack-priv int	hashCode(RecordComponentInternal o) Implements abstract org.jboss.jandex.StrongInternPool.hashCode.

Modifier and Type	Method and Description
pack-priv boolean	equality(String o1, String o2) Implements abstract org.jboss.jandex.StrongInternPool.equality.
pack-priv int	hashCode(String o) Implements abstract org.jboss.jandex.StrongInternPool.hashCode.

Modifier and Type	Method and Description
pack-priv boolean	equality(Type[] o1, Type[] o2) Implements abstract org.jboss.jandex.StrongInternPool.equality.
pack-priv int	hashCode(Type[] o) Implements abstract org.jboss.jandex.StrongInternPool.hashCode.

Modifier and Type	Method and Description
pack-priv boolean	equality(Type o1, Type o2) Implements abstract org.jboss.jandex.StrongInternPool.equality.
pack-priv int	hashCode(Type o) Implements abstract org.jboss.jandex.StrongInternPool.hashCode.

pack-priv abstract Class StrongInternPool<E>

Nested and Inner Type Summary

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

private final Class StrongInternPool.ByteArrayInternPool

Constructor Summary

Method Summary

Constructor Detail

Method Detail

private final Class StrongInternPool.FieldInternPool

Constructor Summary

Method Summary

Constructor Detail

Method Detail

private Class StrongInternPool.IdentityHashSetIterator

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

public Class StrongInternPool.Index

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

private final Class StrongInternPool.MethodInternPool

Constructor Summary

Method Summary

Constructor Detail

Method Detail

private final Class StrongInternPool.RecordComponentInternPool

Constructor Summary

Method Summary

Constructor Detail

Method Detail

private final Class StrongInternPool.StringInternPool

Constructor Summary

Method Summary

Constructor Detail

Method Detail

private final Class StrongInternPool.TypeArrayInternPool

Constructor Summary

Method Summary

Constructor Detail

Method Detail

private final Class StrongInternPool.TypeInternPool

Constructor Summary

Method Summary

Constructor Detail

Method Detail