Package it.unimi.dsi.fastutil.objects

Class AbstractReferenceBigList<K>

java.lang.Object
java.util.AbstractCollection<K>
it.unimi.dsi.fastutil.objects.AbstractReferenceCollection<K>
it.unimi.dsi.fastutil.objects.AbstractReferenceBigList<K>
All Implemented Interfaces:
BigList<K>, ObjectIterable<K>, ReferenceBigList<K>, ReferenceCollection<K>, Size64, Stack<K>, Iterable<K>, Collection<K>
Direct Known Subclasses:
AbstractReferenceBigList.ReferenceSubList, ReferenceBigArrayBigList, ReferenceBigLists.ListBigList, ReferenceBigLists.Singleton
public abstract class AbstractReferenceBigList<K> extends AbstractReferenceCollection<K> implements ReferenceBigList<K>, Stack<K>
An abstract class providing basic methods for big lists implementing a type-specific big list interface.

Most of the methods in this class are optimized with the assumption that the List will have have constant-time random access. If this is not the case, you should probably at least override listIterator(long) and the xAll() methods (such as addAll(long, java.util.Collection<? extends K>)) with a more appropriate iteration scheme. Note the subList(long, long) method is cognizant of random-access or not, so that need not be reimplemented.

  • Method Details

    • add

      public void add(long index, K k)
      Inserts the specified element at the specified position in this big list (optional operation).
      Specified by:
      add in interface BigList<K>
      Parameters:
      index - a position in the big list.
      k - an element to be inserted.
      See Also:
      Implementation Specification:
      This implementation always throws an UnsupportedOperationException.

    • add

      public boolean add(K k)
      Specified by:
      add in interface Collection<K>
      Overrides:
      add in class AbstractCollection<K>
      Implementation Specification:
      This implementation delegates to the type-specific version of BigList.add(long, Object).

    • remove

      public K remove(long i)
      Removes the element at the specified position.
      Specified by:
      remove in interface BigList<K>
      Parameters:
      i - a position in the big list.
      Returns:
      the element previously at the specified position.
      See Also:
      Implementation Specification:
      This implementation always throws an UnsupportedOperationException.

    • set

      public K set(long index, K k)
      Replaces the element at the specified position in this big list with the specified element (optional operation).
      Specified by:
      set in interface BigList<K>
      Parameters:
      index - a position in the big list.
      k - the element to be stored at the specified position.
      Returns:
      the element previously at the specified positions.
      See Also:
      Implementation Specification:
      This implementation always throws an UnsupportedOperationException.

    • addAll

      public boolean addAll(long index, Collection<? extends K> c)
      Adds all of the elements in the specified collection to this list (optional operation).
      Specified by:
      addAll in interface BigList<K>
      Parameters:
      index - index at which to insert the first element from the specified collection.
      c - collection containing elements to be added to this big list.
      Returns:
      true if this big list changed as a result of the call
      See Also:

    • addAll

      public boolean addAll(Collection<? extends K> c)
      Specified by:
      addAll in interface Collection<K>
      Overrides:
      addAll in class AbstractCollection<K>
      Implementation Specification:
      This implementation delegates to the type-specific version of BigList.addAll(long, Collection).

    • iterator

      public ObjectBigListIterator<K> iterator()
      Returns a type-specific iterator on the elements of this collection.
      Specified by:
      iterator in interface Collection<K>
      Specified by:
      iterator in interface Iterable<K>
      Specified by:
      iterator in interface ObjectIterable<K>
      Specified by:
      iterator in interface ReferenceBigList<K>
      Specified by:
      iterator in interface ReferenceCollection<K>
      Specified by:
      iterator in class AbstractReferenceCollection<K>
      Returns:
      a type-specific iterator on the elements of this collection.
      See Also:
      Implementation Specification:
      This implementation delegates to listIterator().

    • listIterator

      public ObjectBigListIterator<K> listIterator()
      Returns a type-specific big-list iterator on this type-specific big list.
      Specified by:
      listIterator in interface BigList<K>
      Specified by:
      listIterator in interface ReferenceBigList<K>
      Returns:
      a big-list iterator over the elements in this big list.
      See Also:
      Implementation Specification:
      This implementation delegates to listIterator(0).

    • listIterator

      public ObjectBigListIterator<K> listIterator(long index)
      Returns a type-specific list iterator on this type-specific big list starting at a given index.
      Specified by:
      listIterator in interface BigList<K>
      Specified by:
      listIterator in interface ReferenceBigList<K>
      Parameters:
      index - index of first element to be returned from the big-list iterator.
      Returns:
      a big-list iterator of the elements in this big list, starting at the specified position in this big list.
      See Also:
      Implementation Specification:
      This implementation is based on the random-access methods.

    • contains

      public boolean contains(Object k)
      Returns true if this list contains the specified element.
      Specified by:
      contains in interface Collection<K>
      Overrides:
      contains in class AbstractCollection<K>
      See Also:
      Implementation Specification:
      This implementation delegates to indexOf().

    • indexOf

      public long indexOf(Object k)
      Description copied from interface: BigList
      Returns the index of the first occurrence of the specified element in this big list, or -1 if this big list does not contain the element.
      Specified by:
      indexOf in interface BigList<K>
      Parameters:
      k - the object to search for.
      Returns:
      the index of the first occurrence of the specified element in this big list, or -1 if this big list does not contain the element.
      See Also:

    • lastIndexOf

      public long lastIndexOf(Object k)
      Description copied from interface: BigList
      Returns the index of the last occurrence of the specified element in this big list, or -1 if this big list does not contain the element.
      Specified by:
      lastIndexOf in interface BigList<K>
      Parameters:
      k - the object to search for.
      Returns:
      the index of the last occurrence of the specified element in this big list, or -1 if this big list does not contain the element.
      See Also:

    • size

      public void size(long size)
      Description copied from interface: BigList
      Sets the size of this big 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 interface BigList<K>
      Parameters:
      size - the new size.

    • subList

      public ReferenceBigList<K> subList(long from, long to)
      Description copied from interface: ReferenceBigList
      Returns a type-specific view of the portion of this type-specific big list from the index from, inclusive, to the index to, exclusive.
      Specified by:
      subList in interface BigList<K>
      Specified by:
      subList in interface ReferenceBigList<K>
      Parameters:
      from - the starting element (inclusive).
      to - the ending element (exclusive).
      Returns:
      a big sublist view of this big list.
      See Also:

    • forEach

      public void forEach(Consumer<? super K> action)
      Specified by:
      forEach in interface Iterable<K>
      Implementation Specification:
      If this list is RandomAccess, will iterate using a for loop and the type-specific List.get(int) method. Otherwise it will fallback to using the iterator based loop implementation from the superinterface.

    • removeElements

      public void removeElements(long from, long to)
      Removes (hopefully quickly) elements of this type-specific big 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 interface ReferenceBigList<K>
      Parameters:
      from - the start index (inclusive).
      to - the end index (exclusive).

    • addElements

      public void addElements(long index, K[][] a, long offset, long length)
      Add (hopefully quickly) elements to this type-specific big 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 interface ReferenceBigList<K>
      Parameters:
      index - the index at which to add elements.
      a - the big array containing the elements.
      offset - the offset of the first element to add.
      length - the number of elements to add.

    • addElements

      public void addElements(long index, K[][] a)
      Add (hopefully quickly) elements to this type-specific big list.
      Specified by:
      addElements in interface ReferenceBigList<K>
      Parameters:
      index - the index at which to add elements.
      a - the big array containing the elements.
      Implementation Specification:
      This implementation delegates to the analogous method for big-array fragments.

    • getElements

      public void getElements(long from, Object[][] a, long offset, long length)
      Copies (hopefully quickly) elements of this type-specific big list into the given big array.

      This is a trivial iterator-based implementation. It is expected that implementations will override this method with a more optimized version.

      Specified by:
      getElements in interface ReferenceBigList<K>
      Parameters:
      from - the start index (inclusive).
      a - the destination big array.
      offset - the offset into the destination big array where to store the first element copied.
      length - the number of elements to be copied.

    • setElements

      public void setElements(long index, K[][] a, long offset, long length)
      Description copied from interface: ReferenceBigList
      Set (hopefully quickly) elements to match the array given. Sets each in this list to the corresponding elements in the array, as if by 
       ListIterator iter = listIterator(index);
 long i = 0;
 while (i < length) {
   iter.next();
   iter.set(BigArrays.get(a, offset + i++);
 }
      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.
      Specified by:
      setElements in interface ReferenceBigList<K>
      Parameters:
      index - the index at which to start setting elements.
      a - the big array containing the elements.
      offset - the offset of the first element to add.
      length - the number of elements to add.

    • clear

      public void clear()
      Specified by:
      clear in interface Collection<K>
      Overrides:
      clear in class AbstractCollection<K>
      Implementation Specification:
      This implementation delegates to removeElements(long, long).

    • size

      @Deprecated public int size()
      Deprecated.
      Please use Size64.size64() instead.
      Returns the size of this data structure, minimized with Integer.MAX_VALUE.

      This default implementation follows the definition above, which is compatible with Collection.size().

      Specified by:
      size in interface BigList<K>
      Specified by:
      size in interface Collection<K>
      Specified by:
      size in interface Size64
      Specified by:
      size in class AbstractCollection<K>
      Returns:
      the size of this data structure, minimized with Integer.MAX_VALUE.
      See Also:
      Implementation Specification:
      This implementation delegates to Size64.size64().

    • hashCode

      public int hashCode()
      Returns the hash code for this big list, which is identical to List.hashCode().
      Specified by:
      hashCode in interface Collection<K>
      Overrides:
      hashCode in class Object
      Returns:
      the hash code for this big list.

    • equals

      public boolean equals(Object o)
      Specified by:
      equals in interface Collection<K>
      Overrides:
      equals in class Object

    • push

      public void push(K o)
      Description copied from interface: Stack
      Pushes the given object on the stack.
      Specified by:
      push in interface Stack<K>
      Parameters:
      o - the object that will become the new top of the stack.

    • pop

      public K pop()
      Description copied from interface: Stack
      Pops the top off the stack.
      Specified by:
      pop in interface Stack<K>
      Returns:
      the top of the stack.

    • top

      public K top()
      Description copied from interface: Stack
      Peeks at the top of the stack (optional operation).

      This default implementation returns peek(0).

      Specified by:
      top in interface Stack<K>
      Returns:
      the top of the stack.

    • peek

      public K peek(int i)
      Description copied from interface: Stack
      Peeks at an element on the stack (optional operation).

      This default implementation just throws an UnsupportedOperationException.

      Specified by:
      peek in interface Stack<K>
      Parameters:
      i - an index from the stop of the stack (0 represents the top).
      Returns:
      the i-th element on the stack.

    • toString

      public String toString()
      Overrides:
      toString in class AbstractReferenceCollection<K>