Class AbstractReferenceBigList.ReferenceSubList<K>

    • Method Summary

      All Methods Instance Methods Concrete Methods 
      Modifier and Type Method Description
      void add​(long index, K k)
      Inserts the specified element at the specified position in this big list (optional operation).
      boolean add​(K k)
      boolean addAll​(long index, java.util.Collection<? extends K> c)
      Adds all of the elements in the specified collection to this list (optional operation).
      void addElements​(long index, K[][] a, long offset, long length)
      Add (hopefully quickly) elements to this type-specific big list.
      K get​(long index)
      Returns the element at the specified position.
      void getElements​(long from, java.lang.Object[][] a, long offset, long length)
      Copies (hopefully quickly) elements of this type-specific big list into the given big array.
      ObjectBigListIterator<K> listIterator​(long index)
      Returns a type-specific list iterator on this type-specific big list starting at a given index.
      K remove​(long index)
      Removes the element at the specified position.
      void removeElements​(long from, long to)
      Removes (hopefully quickly) elements of this type-specific big list.
      K set​(long index, K k)
      Replaces the element at the specified position in this big list with the specified element (optional operation).
      long size64()
      Returns the size of this data structure as a long.
      ReferenceBigList<K> subList​(long from, long to)
      Returns a type-specific view of the portion of this type-specific big list from the index from, inclusive, to the index to, exclusive.
      • Methods inherited from class java.util.AbstractCollection

        containsAll, isEmpty, remove, removeAll, retainAll, toArray, toArray
      • Methods inherited from class java.lang.Object

        getClass, notify, notifyAll, wait, wait, wait
      • Methods inherited from interface java.util.Collection

        containsAll, isEmpty, parallelStream, remove, removeAll, removeIf, retainAll, spliterator, stream, toArray, toArray, toArray
      • Methods inherited from interface java.lang.Iterable

        forEach
      • Methods inherited from interface it.unimi.dsi.fastutil.Stack

        isEmpty
    • Constructor Detail

      • ReferenceSubList

        public ReferenceSubList​(ReferenceBigList<K> l,
                                long from,
                                long to)
    • Method Detail

      • add

        public void add​(long index,
                        K k)
        Description copied from class: AbstractReferenceBigList
        Inserts the specified element at the specified position in this big list (optional operation).

        This implementation always throws an UnsupportedOperationException.

        Specified by:
        add in interface BigList<K>
        Overrides:
        add in class AbstractReferenceBigList<K>
        Parameters:
        index - a position in the big list.
        k - an element to be inserted.
        See Also:
        List.add(int,Object)
      • addAll

        public boolean addAll​(long index,
                              java.util.Collection<? extends K> c)
        Description copied from class: AbstractReferenceBigList
        Adds all of the elements in the specified collection to this list (optional operation).
        Specified by:
        addAll in interface BigList<K>
        Overrides:
        addAll in class AbstractReferenceBigList<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:
        List.addAll(int, Collection)
      • get

        public K get​(long index)
        Description copied from interface: BigList
        Returns the element at the specified position.
        Specified by:
        get in interface BigList<K>
        Parameters:
        index - a position in the big list.
        Returns:
        the element at the specified position.
        See Also:
        List.get(int)
      • remove

        public K remove​(long index)
        Description copied from class: AbstractReferenceBigList
        Removes the element at the specified position.

        This implementation always throws an UnsupportedOperationException.

        Specified by:
        remove in interface BigList<K>
        Overrides:
        remove in class AbstractReferenceBigList<K>
        Parameters:
        index - a position in the big list.
        Returns:
        the element previously at the specified position.
        See Also:
        List.remove(int)
      • set

        public K set​(long index,
                     K k)
        Description copied from class: AbstractReferenceBigList
        Replaces the element at the specified position in this big list with the specified element (optional operation).

        This implementation always throws an UnsupportedOperationException.

        Specified by:
        set in interface BigList<K>
        Overrides:
        set in class AbstractReferenceBigList<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:
        List.set(int,Object)
      • size64

        public long size64()
        Description copied from interface: Size64
        Returns the size of this data structure as a long.
        Specified by:
        size64 in interface Size64
        Returns:
        the size of this data structure.
      • getElements

        public void getElements​(long from,
                                java.lang.Object[][] a,
                                long offset,
                                long length)
        Description copied from class: AbstractReferenceBigList
        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>
        Overrides:
        getElements in class AbstractReferenceBigList<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.
      • removeElements

        public void removeElements​(long from,
                                   long to)
        Description copied from class: AbstractReferenceBigList
        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>
        Overrides:
        removeElements in class AbstractReferenceBigList<K>
        Parameters:
        from - the start index (inclusive).
        to - the end index (exclusive).
      • addElements

        public void addElements​(long index,
                                K[][] a,
                                long offset,
                                long length)
        Description copied from class: AbstractReferenceBigList
        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>
        Overrides:
        addElements in class AbstractReferenceBigList<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.