Top Fields Constructors Methods
org.antlr.v4.runtime.dfa

public final Class HashEdgeMap<T>

extends AbstractEdgeMap<T>
Class Inheritance
Imports
org.antlr.v4.runtime.misc.NotNull, java.util.Collections, .Map, .Set, .TreeMap, java.util.concurrent.atomic.AtomicIntegerArray

Author
Sam Harwell

Field Summary

Modifier and TypeField and Description
private static final int
private final AtomicIntegerArray
private final T[]
Inherited from org.antlr.v4.runtime.dfa.AbstractEdgeMap:
maxIndexminIndex

Constructor Summary

AccessConstructor and Description
public
HashEdgeMap(int minIndex, int maxIndex)

public
HashEdgeMap(int minIndex, int maxIndex, int maxSparseSize)

private
HashEdgeMap(HashEdgeMap<T> map, int maxSparseSize)

Method Summary

Modifier and TypeMethod and Description
private static int
bucket(int length, int key)

private int
bucket(int key)

public AbstractEdgeMap<T>
public boolean
public Set<Map.Entry<Integer, T>>
public T
pack-priv AtomicIntegerArray
pack-priv T[]
public boolean
public AbstractEdgeMap<T>
public HashEdgeMap<T>
public int
public Map<Integer, T>
Inherited from org.antlr.v4.runtime.dfa.AbstractEdgeMap:
putAll

Field Detail

DEFAULT_MAX_SIZEback to summary
private static final int DEFAULT_MAX_SIZE
keysback to summary
private final AtomicIntegerArray keys
valuesback to summary
private final T[] values

Constructor Detail

HashEdgeMapback to summary
public HashEdgeMap(int minIndex, int maxIndex)
HashEdgeMapback to summary
public HashEdgeMap(int minIndex, int maxIndex, int maxSparseSize)
Annotations
@SuppressWarnings:unchecked
HashEdgeMapback to summary
private HashEdgeMap(HashEdgeMap<T> map, int maxSparseSize)
Annotations
@SuppressWarnings:unchecked

Method Detail

bucketback to summary
private static int bucket(int length, int key)
bucketback to summary
private int bucket(int key)
clearback to summary
public AbstractEdgeMap<T> clear()

Implements abstract org.antlr.v4.runtime.dfa.AbstractEdgeMap.clear.

Implements org.antlr.v4.runtime.dfa.EdgeMap.clear.

Annotations
@Override
containsKeyback to summary
public boolean containsKey(int key)

Implements org.antlr.v4.runtime.dfa.EdgeMap.containsKey.

Annotations
@Override
entrySetback to summary
public Set<Map.Entry<Integer, T>> entrySet()

Implements org.antlr.v4.runtime.dfa.EdgeMap.entrySet.

Annotations
@Override
getback to summary
public T get(int key)

Implements org.antlr.v4.runtime.dfa.EdgeMap.get.

Annotations
@Override
getKeysback to summary
pack-priv AtomicIntegerArray getKeys()
Annotations
@NotNull
getValuesback to summary
pack-priv T[] getValues()
Annotations
@NotNull
isEmptyback to summary
public boolean isEmpty()

Implements org.antlr.v4.runtime.dfa.EdgeMap.isEmpty.

Annotations
@Override
putback to summary
public AbstractEdgeMap<T> put(int key, T value)

Implements abstract org.antlr.v4.runtime.dfa.AbstractEdgeMap.put.

Implements org.antlr.v4.runtime.dfa.EdgeMap.put.

Annotations
@Override
removeback to summary
public HashEdgeMap<T> remove(int key)

Implements abstract org.antlr.v4.runtime.dfa.AbstractEdgeMap.remove.

Implements org.antlr.v4.runtime.dfa.EdgeMap.remove.

Annotations
@Override
sizeback to summary
public int size()

Implements org.antlr.v4.runtime.dfa.EdgeMap.size.

Annotations
@Override
toMapback to summary
public Map<Integer, T> toMap()

Implements org.antlr.v4.runtime.dfa.EdgeMap.toMap.

Annotations
@Override