Class DoubleBigList

java.lang.Object
org.magicwerk.brownies.collections.primitive.IDoubleList
org.magicwerk.brownies.collections.primitive.DoubleBigList
All Implemented Interfaces:
Serializable, Cloneable
Direct Known Subclasses:
DoubleBigList.ReadOnlyDoubleBigList
public class DoubleBigList extends IDoubleList
DoubleBigList is a list optimized for storing large number of elements. It stores the elements in fixed size blocks and the blocks itself are maintained in a tree for fast access. It also offers specialized methods for bulk processing of elements. Also copying a DoubleBigList is efficiently possible as its implemented using a copy-on-write approach.

Note that this implementation is not synchronized. Due to data caching used for exploiting locality of reference, performance can decrease if DoubleBigList is accessed by several threads at different positions.

Note that the iterators provided are not fail-fast.

Author:
Thomas Mauch
See Also:

  • Constructor Details

    • DoubleBigList

      protected DoubleBigList(boolean copy, DoubleBigList that)
      Constructor used internally, e.g. for ImmutableDoubleBigList.
      Parameters:
      copy - true to copy all instance values from source, if false nothing is done
      that - list to copy

    • DoubleBigList

      public DoubleBigList()
      Default constructor. The default block size is used.

    • DoubleBigList

      public DoubleBigList(int blockSize)
      Constructor.
      Parameters:
      blockSize - block size

    • DoubleBigList

      public DoubleBigList(Collection<Double> coll)
      Create new list with specified elements.
      Parameters:
      coll - collection with element

  • Method Details

    • EMPTY

      public static DoubleBigList EMPTY()
      Returns:
      unmodifiable empty instance

    • create

      public static DoubleBigList create()

    • create

      public static DoubleBigList create(Collection<Double> coll)
      Create new list with specified elements.
      Parameters:
      coll - collection with element
      type - of elements stored in the list
      Returns:
      created list

    • create

      public static DoubleBigList create(double... elems)
      Create new list with specified elements.
      Parameters:
      elems - array with elements
      type - of elements stored in the list
      Returns:
      created list

    • blockSize

      public int blockSize()
      Returns block size used for this DoubleBigList.
      Returns:
      block size used for this DoubleBigList

    • crop

      public DoubleBigList crop()
      Description copied from class: IDoubleList
      Returns a copy this list but without elements. The new list will have the same type as this list.
      Overrides:
      crop in class IDoubleList
      Returns:
      an empty copy of this list

    • isReadOnly

      public boolean isReadOnly()
      Description copied from class: IDoubleList
      Returns true if this list is either unmodifiable or immutable, false otherwise.
      Specified by:
      isReadOnly in class IDoubleList

    • copy

      public DoubleBigList copy()
      Returns a shallow copy of this list. The new list will contain the same elements as the source list, i.e. the elements themselves are not copied. The capacity of the list will be set to the number of elements, i.e. size and capacity are equal. This returned list will be modifiable, i.e. a read-only list will be copied and be modifiable again.

      The copy is realized by a copy-on-write approach so also really large lists can efficiently be handled.

      Specified by:
      copy in class IDoubleList
      Returns:
      a modifiable copy of this list

    • clone

      public DoubleBigList clone()
      Returns a shallow copy of this list. The new list will contain the same elements as the source list, i.e. the elements themselves are not copied. The capacity of the list will be set to the number of elements, i.e. size and capacity are equal. If the list is read-only, the same list is returned without change. Use IDoubleList.copy() to .

      The copy is realized by a copy-on-write approach so also really large lists can efficiently be handled.

      Overrides:
      clone in class IDoubleList
      Returns:
      a modifiable copy of this list

    • doAssign

      protected void doAssign(IDoubleList that)
      Description copied from class: IDoubleList
      Assign this list the content of the that list. This is done by bitwise copying so the that list should not be used afterwards.
      Specified by:
      doAssign in class IDoubleList
      Parameters:
      that - list to copy content from

    • doClone

      protected void doClone(IDoubleList that)
      Description copied from class: IDoubleList
      Initialize this object after the bitwise copy has been made by Object.clone().
      Specified by:
      doClone in class IDoubleList
      Parameters:
      that - source object

    • getDefaultElem

      public double getDefaultElem()
      Specified by:
      getDefaultElem in class IDoubleList

    • finalize

      protected void finalize()
      Overrides:
      finalize in class Object

    • size

      public int size()
      Specified by:
      size in class IDoubleList

    • capacity

      public int capacity()
      As DoubleBigList grows and shrinks automatically, the term capacity does not really make sense. Therefore always -1 is returned.
      Specified by:
      capacity in class IDoubleList
      Returns:
      capacity of this list

    • doGet

      protected double doGet(int index)
      Description copied from class: IDoubleList
      Helper method for getting an element from the list. This is the only method which really gets an element. Override if you need to validity checks before getting.
      Specified by:
      doGet in class IDoubleList
      Parameters:
      index - index of element to return
      Returns:
      the element at the specified position in this list

    • doSet

      protected double doSet(int index, double elem)
      Description copied from class: IDoubleList
      Helper method for setting an element in the list. This is the only method which really sets an element. Override if you need to validity checks before setting.
      Specified by:
      doSet in class IDoubleList
      Parameters:
      index - index where element will be placed
      elem - element to set
      Returns:
      old element which was at the position

    • doReSet

      protected double doReSet(int index, double elem)
      Description copied from class: IDoubleList
      Sets an element at specified position. This method is used internally if existing elements will be moved etc. Override if you need to validity checks.
      Specified by:
      doReSet in class IDoubleList
      Parameters:
      index - index where element will be placed
      elem - element to set
      Returns:
      old element which was at the position

    • doAdd

      protected boolean doAdd(int index, double element)
      Description copied from class: IDoubleList
      Helper method for adding an element to the list. This is the only method which really adds an element. Override if you need to validity checks before adding.
      Specified by:
      doAdd in class IDoubleList
      Parameters:
      index - index where element should be added (-1 means it is up to the implementation to choose the index)
      element - element to add
      Returns:
      true if element has been added, false otherwise

    • doAddAll

      protected boolean doAddAll(int index, org.magicwerk.brownies.collections.primitive.IDoubleListable list)
      Description copied from class: IDoubleList
      Helper method for adding multiple elements to the list. This default implementation calls doAdd() for adding each element.
      Overrides:
      doAddAll in class IDoubleList
      Parameters:
      index - index where element should be added (-1 is valid for adding at the end)
      list - list with elements to add
      Returns:
      true if elements have been added, false otherwise

    • doClear

      protected void doClear()
      Overrides:
      doClear in class IDoubleList

    • doRemoveAll

      protected void doRemoveAll(int index, int len)
      Description copied from class: IDoubleList
      Remove specified range of elements from list.
      Overrides:
      doRemoveAll in class IDoubleList
      Parameters:
      index - index of first element to remove
      len - number of elements to remove

    • doRemove

      protected double doRemove(int index)
      Description copied from class: IDoubleList
      Helper method to remove an element. This is the only method which really removes an element. Override if you need to validity checks before removing.
      Specified by:
      doRemove in class IDoubleList
      Parameters:
      index - index of element to remove
      Returns:
      removed element

    • unmodifiableList

      public DoubleBigList unmodifiableList()
      Specified by:
      unmodifiableList in class IDoubleList

    • immutableList

      public DoubleBigList immutableList()
      Description copied from class: IDoubleList
      Returns an immutable copy of this list. The returned list is independent from the original list, i.e. changes done later are not seen. Attempts to modify the returned list, whether direct or via its iterator, result in an UnsupportedOperationException. If this list is already immutable, it is returned unchanged. See IDoubleList.unmodifiableList() to get unmodifiable view of a list.
      Specified by:
      immutableList in class IDoubleList
      Returns:
      an immutable copy of the specified list

    • doEnsureCapacity

      protected void doEnsureCapacity(int minCapacity)
      Description copied from class: IDoubleList
      Increases the capacity of this list instance, if necessary, to ensure that it can hold at least the number of elements specified by the minimum capacity argument.
      Specified by:
      doEnsureCapacity in class IDoubleList
      Parameters:
      minCapacity - the desired minimum capacity

    • trimToSize

      public void trimToSize()
      Pack as many elements in the blocks as allowed. An application can use this operation to minimize the storage of an instance.
      Specified by:
      trimToSize in class IDoubleList

    • doCreate

      protected IDoubleList doCreate(int capacity)
      Description copied from class: IDoubleList
      Create list with specified capacity.
      Specified by:
      doCreate in class IDoubleList
      Parameters:
      capacity - initial capacity (use -1 for default capacity)
      Returns:
      created list

    • sort

      public void sort(int index, int len)
      Description copied from class: IDoubleList
      Sort specified elements in the list using the specified comparator.
      Specified by:
      sort in class IDoubleList
      Parameters:
      index - index of first element to sort
      len - number of elements to sort
      See Also:

    • binarySearch

      public int binarySearch(int index, int len, double key)
      Description copied from class: IDoubleList
      Searches the specified range for an object using the binary search algorithm.

      Note that the method is defined to work with an arbitrary type <K>. This allows to search directly for a key field in the object without the need to construct an object containing the key: 

      persons.binarySearch("john", new SearchByName());

class SearchByName implements Comparator<Object> {
 public int compare(Object o1, Object o2) {
   String s1 = (o1 instanceof String) ? (String) o1 : ((Name) o1).getName();
   String s2 = (o2 instanceof String) ? (String) o2 : ((Name) o2).getName();
   return s1.compareTo(s2);
 }
}
/
      Specified by:
      binarySearch in class IDoubleList
      Parameters:
      index - index of first element to search
      len - number of elements to search
      key - the value to be searched for
      Returns:
      index of the search key, if it is contained in the array; otherwise, (-(insertion point) - 1). The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element greater than the key, or a.length if all elements in the array are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.
      See Also: