Class ReferenceLists.Singleton<K>
- java.lang.Object
-
- java.util.AbstractCollection<K>
-
- it.unimi.dsi.fastutil.objects.AbstractReferenceCollection<K>
-
- it.unimi.dsi.fastutil.objects.AbstractReferenceList<K>
-
- it.unimi.dsi.fastutil.objects.ReferenceLists.Singleton<K>
-
- All Implemented Interfaces:
ObjectIterable<K>
,ReferenceCollection<K>
,ReferenceList<K>
,Stack<K>
,java.io.Serializable
,java.lang.Cloneable
,java.lang.Iterable<K>
,java.util.Collection<K>
,java.util.List<K>
,java.util.RandomAccess
- Enclosing class:
- ReferenceLists
public static class ReferenceLists.Singleton<K> extends AbstractReferenceList<K> implements java.util.RandomAccess, java.io.Serializable, java.lang.Cloneable
An immutable class representing a type-specific singleton list.This class may be useful to implement your own in case you subclass a type-specific list.
- See Also:
- Serialized Form
-
-
Nested Class Summary
-
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.objects.AbstractReferenceList
AbstractReferenceList.ReferenceSubList<K>
-
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description boolean
addAll(int i, java.util.Collection<? extends K> c)
Adds all of the elements in the specified collection to this list (optional operation).boolean
addAll(java.util.Collection<? extends K> c)
void
addElements(int index, K[] a)
Add (hopefully quickly) elements to this type-specific list.void
addElements(int index, K[] a, int offset, int length)
Add (hopefully quickly) elements to this type-specific list.void
clear()
java.lang.Object
clone()
boolean
contains(java.lang.Object k)
Returns true if this list contains the specified element.K
get(int i)
ObjectListIterator<K>
iterator()
Returns a type-specific iterator on the elements of this collection.ObjectListIterator<K>
listIterator()
Returns a type-specific list iterator on the list.ObjectListIterator<K>
listIterator(int i)
Returns a type-specific list iterator on the list starting at a given index.K
remove(int i)
boolean
remove(java.lang.Object k)
boolean
removeAll(java.util.Collection<?> c)
void
removeElements(int from, int to)
Removes (hopefully quickly) elements of this type-specific list.boolean
retainAll(java.util.Collection<?> c)
void
setElements(int index, K[] a)
Set (hopefully quickly) elements to match the array given.void
setElements(int index, K[] a, int offset, int length)
Set (hopefully quickly) elements to match the array given.void
setElements(K[] a)
Set (hopefully quickly) elements to match the array given.int
size()
void
size(int size)
Sets the size of this list.void
sort(java.util.Comparator<? super K> comparator)
ReferenceList<K>
subList(int from, int to)
Returns a type-specific view of the portion of this list from the indexfrom
, inclusive, to the indexto
, exclusive.java.lang.Object[]
toArray()
void
unstableSort(java.util.Comparator<? super K> comparator)
Sorts this list using a sort not assured to be stable.-
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractReferenceList
add, add, equals, getElements, hashCode, indexOf, lastIndexOf, peek, pop, push, set, top, toString
-
-
-
-
Method Detail
-
remove
public boolean remove(java.lang.Object k)
-
remove
public K remove(int i)
Description copied from class:AbstractReferenceList
This implementation always throws an
UnsupportedOperationException
.- Specified by:
remove
in interfacejava.util.List<K>
- Overrides:
remove
in classAbstractReferenceList<K>
-
contains
public boolean contains(java.lang.Object k)
Description copied from class:AbstractReferenceList
Returns true if this list contains the specified element.This implementation delegates to
indexOf()
.- Specified by:
contains
in interfacejava.util.Collection<K>
- Specified by:
contains
in interfacejava.util.List<K>
- Overrides:
contains
in classAbstractReferenceList<K>
- See Also:
List.contains(Object)
-
toArray
public java.lang.Object[] toArray()
-
listIterator
public ObjectListIterator<K> listIterator()
Description copied from class:AbstractReferenceList
Returns a type-specific list iterator on the list.This implementation delegates to
listIterator(0)
.- Specified by:
listIterator
in interfacejava.util.List<K>
- Specified by:
listIterator
in interfaceReferenceList<K>
- Overrides:
listIterator
in classAbstractReferenceList<K>
- See Also:
List.listIterator()
-
iterator
public ObjectListIterator<K> iterator()
Description copied from class:AbstractReferenceList
Returns a type-specific iterator on the elements of this collection.Note that this specification strengthens the one given in
Iterable.iterator()
, which was already strengthened in the corresponding type-specific class, but was weakened by the fact that this interface extendsCollection
.This implementation delegates to
AbstractReferenceList.listIterator()
.- Specified by:
iterator
in interfacejava.util.Collection<K>
- Specified by:
iterator
in interfacejava.lang.Iterable<K>
- Specified by:
iterator
in interfacejava.util.List<K>
- Specified by:
iterator
in interfaceObjectIterable<K>
- Specified by:
iterator
in interfaceReferenceCollection<K>
- Specified by:
iterator
in interfaceReferenceList<K>
- Overrides:
iterator
in classAbstractReferenceList<K>
- Returns:
- a type-specific iterator on the elements of this collection.
- See Also:
Iterable.iterator()
-
listIterator
public ObjectListIterator<K> listIterator(int i)
Description copied from class:AbstractReferenceList
Returns a type-specific list iterator on the list starting at a given index.This implementation is based on the random-access methods.
- Specified by:
listIterator
in interfacejava.util.List<K>
- Specified by:
listIterator
in interfaceReferenceList<K>
- Overrides:
listIterator
in classAbstractReferenceList<K>
- See Also:
List.listIterator(int)
-
subList
public ReferenceList<K> subList(int from, int to)
Description copied from interface:ReferenceList
Returns a type-specific view of the portion of this list from the indexfrom
, inclusive, to the indexto
, exclusive.Note that this specification strengthens the one given in
List.subList(int,int)
.- Specified by:
subList
in interfacejava.util.List<K>
- Specified by:
subList
in interfaceReferenceList<K>
- Overrides:
subList
in classAbstractReferenceList<K>
- See Also:
List.subList(int,int)
-
addAll
public boolean addAll(int i, java.util.Collection<? extends K> c)
Description copied from class:AbstractReferenceList
Adds all of the elements in the specified collection to this list (optional operation).- Specified by:
addAll
in interfacejava.util.List<K>
- Overrides:
addAll
in classAbstractReferenceList<K>
-
addAll
public boolean addAll(java.util.Collection<? extends K> c)
Description copied from class:AbstractReferenceList
This implementation delegates to the type-specific version of
List.addAll(int, Collection)
.- Specified by:
addAll
in interfacejava.util.Collection<K>
- Specified by:
addAll
in interfacejava.util.List<K>
- Overrides:
addAll
in classAbstractReferenceList<K>
-
removeAll
public boolean removeAll(java.util.Collection<?> c)
-
retainAll
public boolean retainAll(java.util.Collection<?> c)
-
sort
public void sort(java.util.Comparator<? super K> comparator)
- Specified by:
sort
in interfacejava.util.List<K>
-
unstableSort
public void unstableSort(java.util.Comparator<? super K> comparator)
Description copied from interface:ReferenceList
Sorts this list using a sort not assured to be stable. This differs fromList.sort(java.util.Comparator)
in that the results are not assured to be stable, but may be a bit faster.Unless a subclass specifies otherwise, the results of the method if the list is concurrently modified during the sort are unspecified.
- Specified by:
unstableSort
in interfaceReferenceList<K>
-
removeElements
public void removeElements(int from, int to)
Description copied from class:AbstractReferenceList
Removes (hopefully quickly) elements of this type-specific list.This is a trivial iterator-based implementation. It is expected that implementations will override this method with a more optimized version.
- Specified by:
removeElements
in interfaceReferenceList<K>
- Overrides:
removeElements
in classAbstractReferenceList<K>
- Parameters:
from
- the start index (inclusive).to
- the end index (exclusive).
-
addElements
public void addElements(int index, K[] a)
Description copied from class:AbstractReferenceList
Add (hopefully quickly) elements to this type-specific list.This implementation delegates to the analogous method for array fragments.
- Specified by:
addElements
in interfaceReferenceList<K>
- Overrides:
addElements
in classAbstractReferenceList<K>
- Parameters:
index
- the index at which to add elements.a
- the array containing the elements.
-
addElements
public void addElements(int index, K[] a, int offset, int length)
Description copied from class:AbstractReferenceList
Add (hopefully quickly) elements to this type-specific list.This is a trivial iterator-based implementation. It is expected that implementations will override this method with a more optimized version.
- Specified by:
addElements
in interfaceReferenceList<K>
- Overrides:
addElements
in classAbstractReferenceList<K>
- Parameters:
index
- the index at which to add elements.a
- the array containing the elements.offset
- the offset of the first element to add.length
- the number of elements to add.
-
setElements
public void setElements(K[] a)
Description copied from interface:ReferenceList
Set (hopefully quickly) elements to match the array given.- Specified by:
setElements
in interfaceReferenceList<K>
- Parameters:
a
- the array containing the elements.
-
setElements
public void setElements(int index, K[] a)
Description copied from interface:ReferenceList
Set (hopefully quickly) elements to match the array given.- Specified by:
setElements
in interfaceReferenceList<K>
- Parameters:
index
- the index at which to start setting elements.a
- the array containing the elements.
-
setElements
public void setElements(int index, K[] a, int offset, int length)
Description copied from interface:ReferenceList
Set (hopefully quickly) elements to match the array given. Sets each in this list to the corresponding elements in the array, as if by
However, the exact implementation may be more efficient, taking into account whether random access is faster or not, or at the discretion of subclasses, abuse internals.ListIterator iter = listIterator(index); int i = 0; while (i < length) { iter.next(); iter.set(a[offset + i++]); }
- Specified by:
setElements
in interfaceReferenceList<K>
- Parameters:
index
- the index at which to start setting elements.a
- the array containing the elementsoffset
- the offset of the first element to add.length
- the number of elements to add.
-
size
public int size()
-
size
public void size(int size)
Description copied from interface:ReferenceList
Sets the size of this list.If the specified size is smaller than the current size, the last elements are discarded. Otherwise, they are filled with 0/
null
/false
.- Specified by:
size
in interfaceReferenceList<K>
- Overrides:
size
in classAbstractReferenceList<K>
- Parameters:
size
- the new size.
-
clear
public void clear()
Description copied from class:AbstractReferenceList
This implementation delegates to
AbstractReferenceList.removeElements(int, int)
.- Specified by:
clear
in interfacejava.util.Collection<K>
- Specified by:
clear
in interfacejava.util.List<K>
- Overrides:
clear
in classAbstractReferenceList<K>
-
clone
public java.lang.Object clone()
-
-