Modifier and Type	Class and Description
private class	ArrayEdgeMap.EntryIterator
private class	ArrayEdgeMap.EntrySet

Modifier and Type

Class and Description

private class

ArrayEdgeMap.EntrySet

Modifier and Type	Field and Description
private final AtomicReferenceArray<T>	arrayData
private final AtomicInteger	size

Modifier and Type

Field and Description

private final AtomicReferenceArray<T>

arrayData

private final AtomicInteger

size

Access	Constructor and Description
public	ArrayEdgeMap(int minIndex, int maxIndex)

Access

Constructor and Description

public

ArrayEdgeMap(int minIndex, int maxIndex)

Modifier and Type	Method and Description
public EmptyEdgeMap<T>	clear() Implements abstract org.antlr.v4.runtime.dfa.AbstractEdgeMap.clear. Implements org.antlr.v4.runtime.dfa.EdgeMap.clear.
public boolean	containsKey(int key) Implements org.antlr.v4.runtime.dfa.EdgeMap.containsKey.
public Set<Map.Entry<Integer, T>>	entrySet() Implements org.antlr.v4.runtime.dfa.EdgeMap.entrySet.
public T	get(int key) Implements org.antlr.v4.runtime.dfa.EdgeMap.get.
public boolean	isEmpty() Implements org.antlr.v4.runtime.dfa.EdgeMap.isEmpty.
public ArrayEdgeMap<T>	put(int key, T value) Implements abstract org.antlr.v4.runtime.dfa.AbstractEdgeMap.put. Implements org.antlr.v4.runtime.dfa.EdgeMap.put.
public ArrayEdgeMap<T>	putAll(EdgeMap<? extends T> m) Overrides org.antlr.v4.runtime.dfa.AbstractEdgeMap.putAll. Implements org.antlr.v4.runtime.dfa.EdgeMap.putAll.
public ArrayEdgeMap<T>	remove(int key) Implements abstract org.antlr.v4.runtime.dfa.AbstractEdgeMap.remove. Implements org.antlr.v4.runtime.dfa.EdgeMap.remove.
public int	size() Implements org.antlr.v4.runtime.dfa.EdgeMap.size.
public Map<Integer, T>	toMap() Implements org.antlr.v4.runtime.dfa.EdgeMap.toMap.

Modifier and Type

Method and Description

public EmptyEdgeMap<T>

clear()

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

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

public boolean

containsKey(int key)

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

public Set<Map.Entry<Integer, T>>

entrySet()

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

public T

get(int key)

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

public boolean

isEmpty()

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

public ArrayEdgeMap<T>

put(int key, T value)

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

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

public ArrayEdgeMap<T>

putAll(EdgeMap<? extends T> m)

Overrides org.antlr.v4.runtime.dfa.AbstractEdgeMap.putAll.

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

public ArrayEdgeMap<T>

remove(int key)

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

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

public int

size()

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

public Map<Integer, T>

toMap()

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

arrayData	back to summary
private final AtomicReferenceArray<T> arrayData

arrayData

back to summary

private final AtomicReferenceArray<T> arrayData

size	back to summary
private final AtomicInteger size

size

back to summary

private final AtomicInteger size

ArrayEdgeMap	back to summary
public ArrayEdgeMap(int minIndex, int maxIndex) Annotations @SuppressWarnings:unchecked

ArrayEdgeMap

back to summary

public ArrayEdgeMap(int minIndex, int maxIndex)

Annotations

@SuppressWarnings:unchecked

clear	back to summary
public EmptyEdgeMap<T> clear() Implements abstract org.antlr.v4.runtime.dfa.AbstractEdgeMap.clear. Implements org.antlr.v4.runtime.dfa.EdgeMap.clear. Annotations @Override

clear

back to summary

public EmptyEdgeMap<T> clear()

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

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

Annotations

@Override

containsKey	back to summary
public boolean containsKey(int key) Implements org.antlr.v4.runtime.dfa.EdgeMap.containsKey. Annotations @Override

containsKey

back to summary

public boolean containsKey(int key)

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

Annotations

@Override

entrySet	back to summary
public Set<Map.Entry<Integer, T>> entrySet() Implements org.antlr.v4.runtime.dfa.EdgeMap.entrySet. Annotations @Override

entrySet

back to summary

public Set<Map.Entry<Integer, T>> entrySet()

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

Annotations

@Override

get	back to summary
public T get(int key) Implements org.antlr.v4.runtime.dfa.EdgeMap.get. Annotations @Override

get

back to summary

public T get(int key)

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

Annotations

@Override

isEmpty	back to summary
public boolean isEmpty() Implements org.antlr.v4.runtime.dfa.EdgeMap.isEmpty. Annotations @Override

isEmpty

back to summary

public boolean isEmpty()

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

Annotations

@Override

put	back to summary
public ArrayEdgeMap<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

put

back to summary

public ArrayEdgeMap<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

putAll	back to summary
public ArrayEdgeMap<T> putAll(EdgeMap<? extends T> m) Overrides org.antlr.v4.runtime.dfa.AbstractEdgeMap.putAll. Implements org.antlr.v4.runtime.dfa.EdgeMap.putAll. Annotations @Override @SuppressWarnings:deprecation

putAll

back to summary

public ArrayEdgeMap<T> putAll(EdgeMap<? extends T> m)

Overrides org.antlr.v4.runtime.dfa.AbstractEdgeMap.putAll.

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

Annotations

@Override
@SuppressWarnings:deprecation

remove	back to summary
public ArrayEdgeMap<T> remove(int key) Implements abstract org.antlr.v4.runtime.dfa.AbstractEdgeMap.remove. Implements org.antlr.v4.runtime.dfa.EdgeMap.remove. Annotations @Override

remove

back to summary

public ArrayEdgeMap<T> remove(int key)

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

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

Annotations

@Override

size	back to summary
public int size() Implements org.antlr.v4.runtime.dfa.EdgeMap.size. Annotations @Override

size

back to summary

public int size()

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

Annotations

@Override

toMap	back to summary
public Map<Integer, T> toMap() Implements org.antlr.v4.runtime.dfa.EdgeMap.toMap. Annotations @Override

toMap

back to summary

public Map<Integer, T> toMap()

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

Annotations

@Override

org.antlr.v4.runtime.dfa back to summary

private Class ArrayEdgeMap.EntryIterator

Class Inheritance

extends Object
implements Iterator<Map.Entry<Integer, T>>

java.lang.Object
org.antlr.v4.runtime.dfa.ArrayEdgeMap.EntryIterator

All Implemented Interfaces

java.util.Iterator

Field Summary

Modifier and Type	Field and Description
private int	currentIndex

Constructor Summary

Access	Constructor and Description
private	EntryIterator()

Method Summary

Modifier and Type	Method and Description
public boolean	hasNext() Implements java.util.Iterator.hasNext. Returns `true` if the iteration has more elements.
public Map.Entry<Integer, 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:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

currentIndex	back to summary
private int currentIndex

Constructor Detail

EntryIterator	back to summary
private EntryIterator()

Method Detail

hasNext back to summary

hasNext	back 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

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

next	back to summary
public Map.Entry<Integer, T> next() Implements java.util.Iterator.next. Doc from java.util.Iterator.next. Returns the next element in the iteration. Returns:Map.Entry<Integer, T> the next element in the iteration Annotations @Override

back to summary

public Map.Entry<Integer, T> next()

Implements java.util.Iterator.next.

Doc from java.util.Iterator.next.

Returns the next element in the iteration.

Returns:Map.Entry<Integer, T>

the next element in the iteration

Annotations

@Override

remove back to summary

remove	back 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

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

org.antlr.v4.runtime.dfa back to summary

private Class ArrayEdgeMap.EntrySet

Class Inheritance

extends AbstractEdgeMap<T>.AbstractEntrySet

java.lang.Object
java.util.AbstractCollection
java.util.AbstractSet
org.antlr.v4.runtime.dfa.AbstractEdgeMap.AbstractEntrySet
org.antlr.v4.runtime.dfa.ArrayEdgeMap.EntrySet

Constructor Summary

Access	Constructor and Description
private	EntrySet()

Method Summary

Modifier and Type	Method and Description
public Iterator<Map.Entry<Integer, T>>	iterator() Implements abstract java.util.AbstractCollection.iterator. Implements java.util.Set.iterator, java.util.Collection.iterator. Returns an iterator over the elements in this set.

Inherited from org.antlr.v4.runtime.dfa.AbstractEdgeMap.AbstractEntrySet:: contains size

Constructor Detail

EntrySet	back to summary
private EntrySet()

Method Detail

iterator	back to summary
public Iterator<Map.Entry<Integer, T>> iterator() Implements abstract java.util.AbstractCollection.iterator. Implements java.util.Set.iterator, java.util.Collection.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<Map.Entry<Integer, T>> an iterator over the elements in this set Annotations @Override

iterator

back to summary

public Iterator<Map.Entry<Integer, T>> iterator()

Implements abstract java.util.AbstractCollection.iterator.

Implements java.util.Set.iterator, java.util.Collection.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<Map.Entry<Integer, T>>

an iterator over the elements in this set

Annotations

@Override

public final Class ArrayEdgeMap<T>

Nested and Inner Type Summary

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

private Class ArrayEdgeMap.EntryIterator

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

private Class ArrayEdgeMap.EntrySet

Constructor Summary

Method Summary

Constructor Detail

Method Detail