Modifier and Type	Class and Description
private static class	SmartList.EmptyIterator<T>
private class	SmartList.SingletonIterator
private abstract static class	SmartList.SingletonIteratorBase<T>

Modifier and Type	Field and Description
private Object	myElem
private int	mySize

Access	Constructor and Description
public	SmartList()
public	SmartList(E element)
public	SmartList(@NotNull Collection<? extends E> elements)
public	SmartList(E... elements)

Method Summary

Modifier and Type	Method and Description
public boolean	add(E element to be appended to this list e) Overrides java.util.AbstractList.add. Implements java.util.List.add, java.util.Collection.add. Appends the specified element to the end of this list (optional operation).
public void	add(int index at which the specified element is to be inserted index, E element to be inserted e) Overrides java.util.AbstractList.add. Implements java.util.List.add. Inserts the specified element at the specified position in this list (optional operation).
public void	clear() Overrides java.util.AbstractList.clear. Implements java.util.List.clear, java.util.Collection.clear. Removes all of the elements from this list (optional operation).
public E	get(int index of the element to return index) Implements abstract java.util.AbstractList.get. Implements java.util.List.get. Returns the element at the specified position in this list.
public int	getModificationCount()
public @NotNull Iterator<E>	iterator() Overrides java.util.AbstractList.iterator. Implements java.util.List.iterator, java.util.Collection.iterator. Returns an iterator over the elements in this list in proper sequence.
public E	remove(int the index of the element to be removed index) Overrides java.util.AbstractList.remove. Implements java.util.List.remove. Removes the element at the specified position in this list (optional operation).
public E	set(int index of the element to replace index, E element to be stored at the specified position element) Overrides java.util.AbstractList.set. Implements java.util.List.set. Replaces the element at the specified position in this list with the specified element (optional operation).
public int	size() Implements abstract java.util.AbstractCollection.size. Implements java.util.List.size, java.util.Collection.size. Returns the number of elements in this list.
public void	sort(Comparator<? super E> the `Comparator` used to compare list elements. A `null` value indicates that the elements' natural ordering should be used comparator) Overrides default java.util.List.sort. Sorts this list according to the order induced by the specified `Comparator`.
public <T> T[]	toArray(T[] the array into which the elements of this list are to be stored, if it is big enough; otherwise, a new array of the same runtime type is allocated for this purpose. a) Overrides java.util.AbstractCollection.toArray. Implements java.util.List.toArray, java.util.Collection.toArray. Returns an array containing all of the elements in this list in proper sequence (from first to last element); the runtime type of the returned array is that of the specified array.
public void	trimToSize() Trims the capacity of this list to be the list's current size.

Inherited from java.util.AbstractList:: addAll equals hashCode indexOf lastIndexOf listIterator listIterator removeRange subList

Field Detail

myElem	back to summary
private Object myElem

mySize	back to summary
private int mySize

Constructor Detail

SmartList	back to summary
public SmartList()

SmartList	back to summary
public SmartList(E element)

SmartList	back to summary
public SmartList(@NotNull Collection<? extends E> elements)

SmartList	back to summary
public SmartList(E... elements)

Method Detail

add back to summary

add	back to summary
public boolean add(E e) Overrides java.util.AbstractList.add. Implements java.util.List.add, java.util.Collection.add. Doc from java.util.AbstractList.add. Appends the specified element to the end of this list (optional operation). Lists that support this operation may place limitations on what elements may be added to this list. In particular, some lists will refuse to add null elements, and others will impose restrictions on the type of elements that may be added. List classes should clearly specify in their documentation any restrictions on what elements may be added. Parameters e:E element to be appended to this list Returns:boolean `true` (as specified by `Collection#add`) Annotations @Override

public boolean add(E e)

Overrides java.util.AbstractList.add.

Implements java.util.List.add, java.util.Collection.add.

Doc from java.util.AbstractList.add.

Appends the specified element to the end of this list (optional operation).

Lists that support this operation may place limitations on what elements may be added to this list. In particular, some lists will refuse to add null elements, and others will impose restrictions on the type of elements that may be added. List classes should clearly specify in their documentation any restrictions on what elements may be added.

Parameters

e:E: element to be appended to this list

Returns:boolean

true (as specified by Collection#add)

Annotations

@Override

add	back to summary
public void add(int index, E e) Overrides java.util.AbstractList.add. Implements java.util.List.add. Doc from java.util.AbstractList.add. Inserts the specified element at the specified position in this list (optional operation). Shifts the element currently at that position (if any) and any subsequent elements to the right (adds one to their indices). Parameters index:int Doc from java.util.List.add. index at which the specified element is to be inserted e:E Doc from java.util.List.add. element to be inserted Annotations @Override

add

back to summary

public void add(int index, E e)

Overrides java.util.AbstractList.add.

Implements java.util.List.add.

Doc from java.util.AbstractList.add.

Inserts the specified element at the specified position in this list (optional operation). Shifts the element currently at that position (if any) and any subsequent elements to the right (adds one to their indices).

Parameters

index:int

Doc from java.util.List.add.

index at which the specified element is to be inserted

e:E

Doc from java.util.List.add.

element to be inserted

Annotations

@Override

clear	back to summary
public void clear() Overrides java.util.AbstractList.clear. Implements java.util.List.clear, java.util.Collection.clear. Doc from java.util.AbstractList.clear. Removes all of the elements from this list (optional operation). The list will be empty after this call returns. Annotations @Override

clear

back to summary

public void clear()

Overrides java.util.AbstractList.clear.

Implements java.util.List.clear, java.util.Collection.clear.

Doc from java.util.AbstractList.clear.

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

Annotations

@Override

get	back to summary
public E get(int index) Implements abstract java.util.AbstractList.get. Implements java.util.List.get. Doc from java.util.AbstractList.get. Returns the element at the specified position in this list. Parameters index:int Doc from java.util.List.get. index of the element to return Returns:E Doc from java.util.List.get. the element at the specified position in this list Annotations @Override

get

back to summary

public E get(int index)

Implements abstract java.util.AbstractList.get.

Implements java.util.List.get.

Doc from java.util.AbstractList.get.

Returns the element at the specified position in this list.

Parameters

index:int

Doc from java.util.List.get.

index of the element to return

Returns:E

Doc from java.util.List.get.

the element at the specified position in this list

Annotations

@Override

getModificationCount	back to summary
public int getModificationCount()

iterator	back to summary
public @NotNull Iterator<E> iterator() Overrides java.util.AbstractList.iterator. Implements java.util.List.iterator, java.util.Collection.iterator. Doc from java.util.AbstractList.iterator. Returns an iterator over the elements in this list in proper sequence. Returns:@NotNull Iterator<E> an iterator over the elements in this list in proper sequence Annotations @NotNull @Override

iterator

back to summary

public @NotNull Iterator<E> iterator()

Overrides java.util.AbstractList.iterator.

Implements java.util.List.iterator, java.util.Collection.iterator.

Doc from java.util.AbstractList.iterator.

Returns an iterator over the elements in this list in proper sequence.

Returns:@NotNull Iterator<E>

an iterator over the elements in this list in proper sequence

Annotations

@NotNull
@Override

remove	back to summary
public E remove(int index) Overrides java.util.AbstractList.remove. Implements java.util.List.remove. Doc from java.util.AbstractList.remove. Removes the element at the specified position in this list (optional operation). Shifts any subsequent elements to the left (subtracts one from their indices). Returns the element that was removed from the list. Parameters index:int Doc from java.util.List.remove. the index of the element to be removed Returns:E Doc from java.util.List.remove. the element previously at the specified position Annotations @Override

remove

back to summary

public E remove(int index)

Overrides java.util.AbstractList.remove.

Implements java.util.List.remove.

Doc from java.util.AbstractList.remove.

Removes the element at the specified position in this list (optional operation). Shifts any subsequent elements to the left (subtracts one from their indices). Returns the element that was removed from the list.

Parameters

index:int

Doc from java.util.List.remove.

the index of the element to be removed

Returns:E

Doc from java.util.List.remove.

the element previously at the specified position

Annotations

@Override

set	back to summary
public E set(int index, E element) Overrides java.util.AbstractList.set. Implements java.util.List.set. Doc from java.util.AbstractList.set. Replaces the element at the specified position in this list with the specified element (optional operation). Parameters index:int Doc from java.util.List.set. index of the element to replace element:E Doc from java.util.List.set. element to be stored at the specified position Returns:E Doc from java.util.List.set. the element previously at the specified position Annotations @Override

set

back to summary

public E set(int index, E element)

Overrides java.util.AbstractList.set.

Implements java.util.List.set.

Doc from java.util.AbstractList.set.

Replaces the element at the specified position in this list with the specified element (optional operation).

Parameters

index:int

Doc from java.util.List.set.

index of the element to replace

element:E

Doc from java.util.List.set.

element to be stored at the specified position

Returns:E

Doc from java.util.List.set.

the element previously at the specified position

Annotations

@Override

size back to summary

size	back to summary
public int size() Implements abstract java.util.AbstractCollection.size. Implements java.util.List.size, java.util.Collection.size. Doc from java.util.List.size. Returns the number of elements in this list. If this list contains more than `Integer.MAX_VALUE` elements, returns `Integer.MAX_VALUE`. Returns:int the number of elements in this list Annotations @Override

public int size()

Implements abstract java.util.AbstractCollection.size.

Implements java.util.List.size, java.util.Collection.size.

Doc from java.util.List.size.

Returns the number of elements in this list. If this list contains more than Integer.MAX_VALUE elements, returns Integer.MAX_VALUE.

Returns:int

the number of elements in this list

Annotations

@Override

sort back to summary

sort	back to summary
public void sort(Comparator<? super E> comparator) Overrides default java.util.List.sort. Doc from java.util.List.sort. Sorts this list according to the order induced by the specified `Comparator`. The sort is stable: this method must not reorder equal elements. All elements in this list must be mutually comparable using the specified comparator (that is, `c.compare(e1, e2)` must not throw a `ClassCastException` for any elements `e1` and `e2` in the list). If the specified comparator is `null` then all elements in this list must implement the `Comparable` interface and the elements' natural ordering should be used. This list must be modifiable, but need not be resizable. Parameters comparator:Comparator<? super E> the `Comparator` used to compare list elements. A `null` value indicates that the elements' natural ordering should be used

public void sort(Comparator<? super E> comparator)

Overrides default java.util.List.sort.

Doc from java.util.List.sort.

Sorts this list according to the order induced by the specified Comparator. The sort is stable: this method must not reorder equal elements.

All elements in this list must be mutually comparable using the specified comparator (that is, c.compare(e1, e2) must not throw a ClassCastException for any elements e1 and e2 in the list).

If the specified comparator is null then all elements in this list must implement the Comparable interface and the elements' natural ordering should be used.

This list must be modifiable, but need not be resizable.

Parameters

comparator:Comparator<? super E>: the Comparator used to compare list elements. A null value indicates that the elements' natural ordering should be used

toArray back to summary

toArray	back to summary
public <T> T[] toArray(T[] a) Overrides java.util.AbstractCollection.toArray. Implements java.util.List.toArray, java.util.Collection.toArray. Doc from java.util.List.toArray. Returns an array containing all of the elements in this list in proper sequence (from first to last element); the runtime type of the returned array is that of the specified array. If the list 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 list. If the list fits in the specified array with room to spare (i.e., the array has more elements than the list), the element in the array immediately following the end of the list is set to `null`. (This is useful in determining the length of the list only if the caller knows that the list does not contain any null elements.) 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 list known to contain only strings. The following code can be used to dump the list 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 <T> Doc from java.util.Collection.toArray. the component type of the array to contain the collection a:T[] the array into which the elements of this list are to be stored, if it is big enough; otherwise, a new array of the same runtime type is allocated for this purpose. Returns:T[] an array containing the elements of this list Annotations @NotNull @Override

public <T> T[] toArray(T[] a)

Overrides java.util.AbstractCollection.toArray.

Implements java.util.List.toArray, java.util.Collection.toArray.

Doc from java.util.List.toArray.

Returns an array containing all of the elements in this list in proper sequence (from first to last element); the runtime type of the returned array is that of the specified array. If the list 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 list.

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

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 list known to contain only strings. The following code can be used to dump the list 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

<T>: Doc from java.util.Collection.toArray. the component type of the array to contain the collection
a:T[]: the array into which the elements of this list are to be stored, if it is big enough; otherwise, a new array of the same runtime type is allocated for this purpose.

Returns:T[]

an array containing the elements of this list

Annotations

@NotNull
@Override

trimToSize	back to summary
public void trimToSize() Trims the capacity of this list to be the list's current size. An application can use this operation to minimize the storage of a list instance.

kotlin.reflect.jvm.internal.impl.utils back to summary

private Class SmartList.EmptyIterator<T>

Class Inheritance

extends Object
implements Iterator<T>

java.lang.Object
kotlin.reflect.jvm.internal.impl.utils.SmartList.EmptyIterator

All Implemented Interfaces

java.util.Iterator

Field Summary

Modifier and Type	Field and Description
private static final SmartList.EmptyIterator<T>	INSTANCE

Constructor Summary

Access	Constructor and Description
private	EmptyIterator()

Method Summary

Modifier and Type	Method and Description
public static <T> SmartList.EmptyIterator<T>	getInstance()
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:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

INSTANCE	back to summary
private static final SmartList.EmptyIterator<T> INSTANCE

Constructor Detail

EmptyIterator	back to summary
private EmptyIterator()

Method Detail

getInstance	back to summary
public static <T> SmartList.EmptyIterator<T> getInstance()

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

back 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

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

kotlin.reflect.jvm.internal.impl.utils back to summary

private Class SmartList.SingletonIterator

Class Inheritance

extends SmartList.SingletonIteratorBase<E>

java.lang.Object
kotlin.reflect.jvm.internal.impl.utils.SmartList.SingletonIteratorBase
kotlin.reflect.jvm.internal.impl.utils.SmartList.SingletonIterator

Field Summary

Modifier and Type	Field and Description
private final int	myInitialModCount

Constructor Summary

Access	Constructor and Description
public	SingletonIterator()

Method Summary

Modifier and Type	Method and Description
protected void	checkCoModification() Implements abstract kotlin.reflect.jvm.internal.impl.utils.SmartList.SingletonIteratorBase.checkCoModification.
protected E	getElement() Implements abstract kotlin.reflect.jvm.internal.impl.utils.SmartList.SingletonIteratorBase.getElement.
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 kotlin.reflect.jvm.internal.impl.utils.SmartList.SingletonIteratorBase:: hasNext next

Field Detail

myInitialModCount	back to summary
private final int myInitialModCount

Constructor Detail

SingletonIterator	back to summary
public SingletonIterator()

Method Detail

checkCoModification	back to summary
protected void checkCoModification() Implements abstract kotlin.reflect.jvm.internal.impl.utils.SmartList.SingletonIteratorBase.checkCoModification. Annotations @Override

checkCoModification

back to summary

protected void checkCoModification()

Implements abstract kotlin.reflect.jvm.internal.impl.utils.SmartList.SingletonIteratorBase.checkCoModification.

Annotations

@Override

getElement	back to summary
protected E getElement() Implements abstract kotlin.reflect.jvm.internal.impl.utils.SmartList.SingletonIteratorBase.getElement. Annotations @Override

getElement

back to summary

protected E getElement()

Implements abstract kotlin.reflect.jvm.internal.impl.utils.SmartList.SingletonIteratorBase.getElement.

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 this method is called after a call to the forEachRemaining method.

Annotations

@Override

kotlin.reflect.jvm.internal.impl.utils back to summary

private abstract Class SmartList.SingletonIteratorBase<T>

Class Inheritance

extends Object
implements Iterator<T>

java.lang.Object
kotlin.reflect.jvm.internal.impl.utils.SmartList.SingletonIteratorBase

All Implemented Interfaces

java.util.Iterator

Known Direct Subclasses

kotlin.reflect.jvm.internal.impl.utils.SmartList.SingletonIterator

Field Summary

Modifier and Type	Field and Description
private boolean	myVisited

Constructor Summary

Access	Constructor and Description
private	SingletonIteratorBase()

Method Summary

Modifier and Type	Method and Description
protected abstract void	checkCoModification()
protected abstract T	getElement()
public final boolean	hasNext() Implements java.util.Iterator.hasNext. Returns `true` if the iteration has more elements.
public final T	next() Implements java.util.Iterator.next. Returns the next element in the iteration.

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

Field Detail

myVisited	back to summary
private boolean myVisited

Constructor Detail

SingletonIteratorBase	back to summary
private SingletonIteratorBase()

Method Detail

checkCoModification	back to summary
protected abstract void checkCoModification()

getElement	back to summary
protected abstract T getElement()

hasNext back to summary

hasNext	back to summary
public final 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 final 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 final 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

back to summary

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

public Class SmartList<E>

Nested and Inner Type Summary

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

private Class SmartList.EmptyIterator<T>

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

private Class SmartList.SingletonIterator

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

private abstract Class SmartList.SingletonIteratorBase<T>

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail