Top Description Inners Fields Constructors Methods
org.antlr.v4.runtime.misc

public Class Array2DHashSet<T>

extends Object
implements Set<T>
Class Inheritance
All Implemented Interfaces
java.util.Set, java.util.Collection, java.lang.Iterable
Known Direct Subclasses
org.antlr.v4.runtime.atn.ATNConfigSet.AbstractConfigHashSet
Imports
java.util.Arrays, .Collection, .Iterator, .NoSuchElementException, .Set

Set implementation with closed hashing (open addressing).

Nested and Inner Type Summary

Modifier and TypeClass and Description
protected class

Field Summary

Modifier and TypeField and Description
protected T[][]
protected final AbstractEqualityComparator<? super T>
protected int
public static final int
public static final int
protected final int
protected final int
public static final double
protected int
n

How many elements in set

protected int
threshold

when to expand

Constructor Summary

AccessConstructor and Description
public
public
public
Array2DHashSet(AbstractEqualityComparator<? super T> comparator, int initialCapacity, int initialBucketCapacity)

Method Summary

Modifier and TypeMethod and Description
public final boolean
add(T
element to be added to this set
t
)

Implements java.util.Set.add.

Adds the specified element to this set if it is not already present (optional operation).
public boolean
addAll(Collection<? extends T>
collection containing elements to be added to this set
c
)

Implements java.util.Set.addAll.

Adds all of the elements in the specified collection to this set if they're not already present (optional operation).
protected T

Returns:

o if it could be an instance of T, otherwise null.
asElementType
(Object
the object to try and cast to the element type of the set
o
)

Return o as an instance of the element type T.

public void
clear()

Implements java.util.Set.clear.

Removes all of the elements from this set (optional operation).
public final boolean
contains(Object
element whose presence in this set is to be tested
o
)

Implements java.util.Set.contains.

Returns true if this set contains the specified element.
public boolean
containsAll(Collection<?>
collection to be checked for containment in this set
collection
)

Implements java.util.Set.containsAll.

Returns true if this set contains all of the elements of the specified collection.
public boolean
containsFast(T obj)

protected T[]

Returns:

the newly constructed array
createBucket
(int
the length of the array to return
capacity
)

Return an array of T with length capacity.

protected T[][]

Returns:

the newly constructed array
createBuckets
(int
the length of the array to return
capacity
)

Return an array of T[] with length capacity.

public boolean
equals(Object
object to be compared for equality with this set
o
)

Overrides java.lang.Object.equals.

Implements java.util.Set.equals.

Compares the specified object with this set for equality.
protected void
public T
get(T o)

protected final int
getBucket(T o)

public final T
getOrAdd(T o)

Add o to set if not there; return existing value if already there.

protected T
public int
hashCode()

Overrides java.lang.Object.hashCode.

Implements java.util.Set.hashCode.

Returns the hash code value for this set.
public final boolean
isEmpty()

Implements java.util.Set.isEmpty.

Returns true if this set contains no elements.
public Iterator<T>
iterator()

Implements java.util.Set.iterator.

Returns an iterator over the elements in this set.
public final boolean
remove(Object
object to be removed from this set, if present
o
)

Implements java.util.Set.remove.

Removes the specified element from this set if it is present (optional operation).
public boolean
removeAll(Collection<?>
collection containing elements to be removed from this set
c
)

Implements java.util.Set.removeAll.

Removes from this set all of its elements that are contained in the specified collection (optional operation).
public boolean
removeFast(T obj)

public boolean
retainAll(Collection<?>
collection containing elements to be retained in this set
c
)

Implements java.util.Set.retainAll.

Retains only the elements in this set that are contained in the specified collection (optional operation).
public final int
size()

Implements java.util.Set.size.

Returns the number of elements in this set (its cardinality).
public T[]
toArray()

Implements java.util.Set.toArray.

Returns an array containing all of the elements in this set.
public <U> U[]
toArray(U[]
the array into which the elements of this set are to be stored, if it is big enough; otherwise, a new array of the same runtime type is allocated for this purpose.
a
)

Implements java.util.Set.toArray.

Returns an array containing all of the elements in this set; the runtime type of the returned array is that of the specified array.
public String
toString()

Overrides java.lang.Object.toString.

Returns a string representation of the object.
public String
Inherited from java.lang.Object:
clonefinalizegetClassnotifynotifyAllwaitwaitwait

Field Detail

bucketsback to summary
protected T[][] buckets
comparatorback to summary
protected final AbstractEqualityComparator<? super T> comparator
currentPrimeback to summary
protected int currentPrime
INITAL_BUCKET_CAPACITYback to summary
public static final int INITAL_BUCKET_CAPACITY
INITAL_CAPACITYback to summary
public static final int INITAL_CAPACITY
initialBucketCapacityback to summary
protected final int initialBucketCapacity
initialCapacityback to summary
protected final int initialCapacity
LOAD_FACTORback to summary
public static final double LOAD_FACTOR
nback to summary
protected int n

How many elements in set

thresholdback to summary
protected int threshold

when to expand

Constructor Detail

Array2DHashSetback to summary
public Array2DHashSet()
Array2DHashSetback to summary
public Array2DHashSet(AbstractEqualityComparator<? super T> comparator)
Array2DHashSetback to summary
public Array2DHashSet(AbstractEqualityComparator<? super T> comparator, int initialCapacity, int initialBucketCapacity)

Method Detail

addback to summary
public final boolean add(T t)

Implements java.util.Set.add.

Doc from java.util.Set.add.

Adds the specified element to this set if it is not already present (optional operation). More formally, adds the specified element e to this set if the set contains no element e2 such that Objects.equals(e, e2). If this set already contains the element, the call leaves the set unchanged and returns false. In combination with the restriction on constructors, this ensures that sets never contain duplicate elements.

The stipulation above does not imply that sets must accept all elements; sets may refuse to add any particular element, including null, and throw an exception, as described in the specification for Collection.add. Individual set implementations should clearly document any restrictions on the elements that they may contain.

Parameters
t:T

element to be added to this set

Returns:boolean

true if this set did not already contain the specified element

Annotations
@Override
addAllback to summary
public boolean addAll(Collection<? extends T> c)

Implements java.util.Set.addAll.

Doc from java.util.Set.addAll.

Adds all of the elements in the specified collection to this set if they're not already present (optional operation). If the specified collection is also a set, the addAll operation effectively modifies this set so that its value is the union of the two sets. The behavior of this operation is undefined if the specified collection is modified while the operation is in progress.

Parameters
c:Collection<? extends T>

collection containing elements to be added to this set

Returns:boolean

true if this set changed as a result of the call

Annotations
@Override
asElementTypeback to summary
protected T asElementType(Object o)

Return o as an instance of the element type T. If o is non-null but known to not be an instance of T, this method returns null. The base implementation does not perform any type checks; override this method to provide strong type checks for the contains and remove methods to ensure the arguments to the EqualityComparator for the set always have the expected types.

Parameters
o:Object

the object to try and cast to the element type of the set

Returns:T

o if it could be an instance of T, otherwise null.

Annotations
@SuppressWarnings:unchecked
clearback to summary
public void clear()

Implements java.util.Set.clear.

Doc from java.util.Set.clear.

Removes all of the elements from this set (optional operation). The set will be empty after this call returns.

Annotations
@Override
containsback to summary
public final boolean contains(Object o)

Implements java.util.Set.contains.

Doc from java.util.Set.contains.

Returns true if this set contains the specified element. More formally, returns true if and only if this set contains an element e such that Objects.equals(o, e).

Parameters
o:Object

element whose presence in this set is to be tested

Returns:boolean

true if this set contains the specified element

Annotations
@Override
containsAllback to summary
public boolean containsAll(Collection<?> collection)

Implements java.util.Set.containsAll.

Doc from java.util.Set.containsAll.

Returns true if this set contains all of the elements of the specified collection. If the specified collection is also a set, this method returns true if it is a subset of this set.

Parameters
collection:Collection<?>

collection to be checked for containment in this set

Returns:boolean

true if this set contains all of the elements of the specified collection

Annotations
@Override
containsFastback to summary
public boolean containsFast(T obj)
createBucketback to summary
protected T[] createBucket(int capacity)

Return an array of T with length capacity.

Parameters
capacity:int

the length of the array to return

Returns:T[]

the newly constructed array

Annotations
@SuppressWarnings:unchecked
createBucketsback to summary
protected T[][] createBuckets(int capacity)

Return an array of T[] with length capacity.

Parameters
capacity:int

the length of the array to return

Returns:T[][]

the newly constructed array

Annotations
@SuppressWarnings:unchecked
equalsback to summary
public boolean equals(Object o)

Overrides java.lang.Object.equals.

Implements java.util.Set.equals.

Doc from java.util.Set.equals.

Compares the specified object with this set for equality. Returns true if the specified object is also a set, the two sets have the same size, and every member of the specified set is contained in this set (or equivalently, every member of this set is contained in the specified set). This definition ensures that the equals method works properly across different implementations of the set interface.

Parameters
o:Object

object to be compared for equality with this set

Returns:boolean

true if the specified object is equal to this set

Annotations
@Override
expandback to summary
protected void expand()
getback to summary
public T get(T o)
getBucketback to summary
protected final int getBucket(T o)
getOrAddback to summary
public final T getOrAdd(T o)

Add o to set if not there; return existing value if already there. This method performs the same operation as add aside from the return value.

getOrAddImplback to summary
protected T getOrAddImpl(T o)
hashCodeback to summary
public int hashCode()

Overrides java.lang.Object.hashCode.

Implements java.util.Set.hashCode.

Doc from java.util.Set.hashCode.

Returns the hash code value for this set. The hash code of a set is defined to be the sum of the hash codes of the elements in the set, where the hash code of a null element is defined to be zero. This ensures that s1.equals(s2) implies that s1.hashCode()==s2.hashCode() for any two sets s1 and s2, as required by the general contract of Object#hashCode.

Returns:int

the hash code value for this set

Annotations
@Override
isEmptyback to summary
public final boolean isEmpty()

Implements java.util.Set.isEmpty.

Doc from java.util.Set.isEmpty.

Returns true if this set contains no elements.

Returns:boolean

true if this set contains no elements

Annotations
@Override
iteratorback to summary
public Iterator<T> iterator()

Implements java.util.Set.iterator.

Doc from java.util.Set.iterator.

Returns an iterator over the elements in this set. The elements are returned in no particular order (unless this set is an instance of some class that provides a guarantee).

Returns:Iterator<T>

an iterator over the elements in this set

Annotations
@Override
removeback to summary
public final boolean remove(Object o)

Implements java.util.Set.remove.

Doc from java.util.Set.remove.

Removes the specified element from this set if it is present (optional operation). More formally, removes an element e such that Objects.equals(o, e), if this set contains such an element. Returns true if this set contained the element (or equivalently, if this set changed as a result of the call). (This set will not contain the element once the call returns.)

Parameters
o:Object

object to be removed from this set, if present

Returns:boolean

true if this set contained the specified element

Annotations
@Override
removeAllback to summary
public boolean removeAll(Collection<?> c)

Implements java.util.Set.removeAll.

Doc from java.util.Set.removeAll.

Removes from this set all of its elements that are contained in the specified collection (optional operation). If the specified collection is also a set, this operation effectively modifies this set so that its value is the asymmetric set difference of the two sets.

Parameters
c:Collection<?>

collection containing elements to be removed from this set

Returns:boolean

true if this set changed as a result of the call

Annotations
@Override
removeFastback to summary
public boolean removeFast(T obj)
retainAllback to summary
public boolean retainAll(Collection<?> c)

Implements java.util.Set.retainAll.

Doc from java.util.Set.retainAll.

Retains only the elements in this set that are contained in the specified collection (optional operation). In other words, removes from this set all of its elements that are not contained in the specified collection. If the specified collection is also a set, this operation effectively modifies this set so that its value is the intersection of the two sets.

Parameters
c:Collection<?>

collection containing elements to be retained in this set

Returns:boolean

true if this set changed as a result of the call

Annotations
@Override
sizeback to summary
public final int size()

Implements java.util.Set.size.

Doc from java.util.Set.size.

Returns the number of elements in this set (its cardinality). If this set contains more than Integer.MAX_VALUE elements, returns Integer.MAX_VALUE.

Returns:int

the number of elements in this set (its cardinality)

Annotations
@Override
toArrayback to summary
public T[] toArray()

Implements java.util.Set.toArray.

Doc from java.util.Set.toArray.

Returns an array containing all of the elements in this set. If this set makes any guarantees as to what order its elements are returned by its iterator, this method must return the elements in the same order.

The returned array will be "safe" in that no references to it are maintained by this set. (In other words, this method must allocate a new array even if this set is backed by an array). The caller is thus free to modify the returned array.

This method acts as bridge between array-based and collection-based APIs.

Returns:T[]

an array containing all the elements in this set

Annotations
@Override
toArrayback to summary
public <U> U[] toArray(U[] a)

Implements java.util.Set.toArray.

Doc from java.util.Set.toArray.

Returns an array containing all of the elements in this set; the runtime type of the returned array is that of the specified array. If the set fits in the specified array, it is returned therein. Otherwise, a new array is allocated with the runtime type of the specified array and the size of this set.

If this set fits in the specified array with room to spare (i.e., the array has more elements than this set), the element in the array immediately following the end of the set is set to null. (This is useful in determining the length of this set only if the caller knows that this set does not contain any null elements.)

If this set makes any guarantees as to what order its elements are returned by its iterator, this method must return the elements in the same order.

Like the toArray() method, this method acts as bridge between array-based and collection-based APIs. Further, this method allows precise control over the runtime type of the output array, and may, under certain circumstances, be used to save allocation costs.

Suppose x is a set known to contain only strings. The following code can be used to dump the set into a newly allocated array of String:

    String[] y = x.toArray(new String[0]);
Note that toArray(new Object[0]) is identical in function to toArray().
Parameters
<U>

Doc from java.util.Collection.toArray. the component type of the array to contain the collection

a:U[]

the array into which the elements of this set are to be stored, if it is big enough; otherwise, a new array of the same runtime type is allocated for this purpose.

Returns:U[]

an array containing all the elements in this set

Annotations
@Override
toStringback to summary
public String toString()

Overrides java.lang.Object.toString.

Doc from java.lang.Object.toString.

Returns a string representation of the object.

Returns:String

a string representation of the object.

Annotations
@Override
toTableStringback to summary
public String toTableString()
org.antlr.v4.runtime.misc back to summary

protected Class Array2DHashSet.SetIterator

extends Object
implements Iterator<T>
Class Inheritance
All Implemented Interfaces
java.util.Iterator

Field Summary

Modifier and TypeField and Description
pack-priv final T[]
pack-priv int
pack-priv boolean

Constructor Summary

AccessConstructor and Description
public
SetIterator(T[] data)

Method Summary

Modifier and TypeMethod and Description
public boolean
hasNext()

Implements java.util.Iterator.hasNext.

Returns true if the iteration has more elements.
public T
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).
Inherited from java.lang.Object:
cloneequalsfinalizegetClasshashCodenotifynotifyAlltoStringwaitwaitwait

Field Detail

databack to summary
pack-priv final T[] data
nextIndexback to summary
pack-priv int nextIndex
removedback to summary
pack-priv boolean removed

Constructor Detail

SetIteratorback to summary
public SetIterator(T[] data)

Method Detail

hasNextback to summary
public boolean hasNext()

Implements java.util.Iterator.hasNext.

Doc from java.util.Iterator.hasNext.

Returns true if the iteration has more elements. (In other words, returns true if next would return an element rather than throwing an exception.)

Returns:boolean

true if the iteration has more elements

Annotations
@Override
nextback to summary
public T next()

Implements java.util.Iterator.next.

Doc from java.util.Iterator.next.

Returns the next element in the iteration.

Returns:T

the next element in the iteration

Annotations
@Override
removeback to summary
public void remove()

Overrides default java.util.Iterator.remove.

Doc from java.util.Iterator.remove.

Removes from the underlying collection the last element returned by this iterator (optional operation). This method can be called only once per call to next.

The behavior of an iterator is unspecified if the underlying collection is modified while the iteration is in progress in any way other than by calling this method, unless an overriding class has specified a concurrent modification policy.

The behavior of an iterator is unspecified if this method is called after a call to the forEachRemaining method.

Annotations
@Override