java.lang.Object
org.magicwerk.brownies.collections.primitive.IByteList
org.magicwerk.brownies.collections.primitive.ByteBigList
All Implemented Interfaces:
Serializable, Cloneable, IByteListable
Direct Known Subclasses:
ByteBigList.ReadOnlyByteBigList

public class ByteBigList extends IByteList
ByteBigList 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 ByteBigList 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 ByteBigList is accessed by several threads at different positions.

Note that the iterators provided are not fail-fast.

See Also:
  • Field Details

    • serialVersionUID

      private static final long serialVersionUID
      UID for serialization
      See Also:
    • DEFAULT_BLOCK_SIZE

      private static final int DEFAULT_BLOCK_SIZE
      Default block size
      See Also:
    • MERGE_THRESHOLD

      private static final float MERGE_THRESHOLD
      If two adjacent blocks both less than MERGE_THRESHOLD*blockSize elements, they are merged
      See Also:
    • FILL_THRESHOLD

      private static final float FILL_THRESHOLD
      If an element is added to the list at the head or tail, the block is only filled until it has FILL_THRESHOLD*blockSize elements (so there is room for insertion without need to split).
      See Also:
    • CHECK

      private static final boolean CHECK
      Set to true for debugging during developing
      See Also:
    • EMPTY

      private static final ByteBigList EMPTY
      Unmodifiable empty instance
    • blockSize

      private int blockSize
      Number of elements stored at maximum in a block
    • size

      private int size
      Number of elements stored in this ByteBigList
    • rootNode

      private ByteBigList.ByteBlockNode rootNode
      The root node in the tree
    • currNode

      private ByteBigList.ByteBlockNode currNode
      Current node
    • currByteBlockStart

      private int currByteBlockStart
      Start index of current block
    • currByteBlockEnd

      private int currByteBlockEnd
      End index of current block
    • currModify

      private int currModify
      Modify value which must be applied before this block is not current any more
  • Constructor Details

    • ByteBigList

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

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

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

      public ByteBigList(Collection<Byte> coll)
      Create new list with specified elements.
      Parameters:
      coll - collection with element
    • ByteBigList

      private ByteBigList(int blockSize, int firstByteBlockSize)
      Internal constructor.
      Parameters:
      blockSize - default block size
      firstByteBlockSize - block size of first block
  • Method Details

    • EMPTY

      public static ByteBigList EMPTY()
      Returns:
      unmodifiable empty instance
    • create

      public static ByteBigList create()
    • create

      public static ByteBigList create(Collection<Byte> 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 ByteBigList create(byte... 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 ByteBigList.
      Returns:
      block size used for this ByteBigList
    • doInit

      private void doInit(int blockSize, int firstByteBlockSize)
      Initialize ByteBigList.
      Parameters:
      blockSize - default block size
      firstByteBlockSize - block size of first block
    • crop

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

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

      public ByteBigList 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 IByteList
      Returns:
      a modifiable copy of this list
    • clone

      public ByteBigList 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 IByteList.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 IByteList
      Returns:
      a modifiable copy of this list
    • doAssign

      protected void doAssign(IByteList that)
      Description copied from class: IByteList
      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 IByteList
      Parameters:
      that - list to copy content from
    • doClone

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

      Create a copy of the specified node.
      Parameters:
      node - source node
      Returns:
      newly created copy of source
    • getDefaultElem

      public byte getDefaultElem()
      Specified by:
      getDefaultElem in class IByteList
    • finalize

      protected void finalize()
      Overrides:
      finalize in class Object
    • size

      public int size()
      Specified by:
      size in interface IByteListable
      Specified by:
      size in class IByteList
    • capacity

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

      protected byte doGet(int index)
      Description copied from class: IByteList
      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 IByteList
      Parameters:
      index - index of element to return
      Returns:
      the element at the specified position in this list
    • doSet

      protected byte doSet(int index, byte elem)
      Description copied from class: IByteList
      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 IByteList
      Parameters:
      index - index where element will be placed
      elem - element to set
      Returns:
      old element which was at the position
    • doReSet

      protected byte doReSet(int index, byte elem)
      Description copied from class: IByteList
      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 IByteList
      Parameters:
      index - index where element will be placed
      elem - element to set
      Returns:
      old element which was at the position
    • releaseByteBlock

      private void releaseByteBlock()
      Release current block and apply modification if pending.
    • getByteBlockIndex

      private int getByteBlockIndex(int index, boolean write, int modify)
      Returns index in block where the element with specified index is located. This method also sets currByteBlock to remember this last used block.
      Parameters:
      index - list index (0 invalid input: '<'= index invalid input: '<'= size())
      write - true if the block is needed for a write operation (set, add, remove)
      modify - modify instruction (N>0: N elements are added, Ninvalid input: '<'0: N elements are removed, 0 no change)
      Returns:
      relative index within block
    • getByteBlockIndex2

      private int getByteBlockIndex2(int index, boolean write, int modify)
    • isOnlyRootByteBlock

      private boolean isOnlyRootByteBlock()
      Returns:
      true if there is only the root block, false otherwise
    • doGetByteBlock

      private void doGetByteBlock(int index, int modify)
      Determine node/block for the specified index. The fields currNode, currByteBlockStart, and currByteBlockEnd are set. During the traversing the tree node, the nodes relative positions are changed according to the modify instruction.
      Parameters:
      index - list index for which block must be determined
      modify - modify instruction (N>0: N elements are added, Ninvalid input: '<'0: N elements are removed, 0 no change)
    • doGetByteBlockLeft

      private boolean doGetByteBlockLeft(int modify, ByteBigList.ByteBlockNode nextNode, boolean wasLeft)
    • doGetByteBlockRight

      private boolean doGetByteBlockRight(int modify, ByteBigList.ByteBlockNode nextNode, boolean wasLeft)
    • addByteBlock

      private void addByteBlock(int index, ByteBigList.ByteBlock obj)
      Adds a new element to the list.
      Parameters:
      index - the index to add before
      obj - the element to add
    • doAdd

      protected boolean doAdd(int index, byte element)
      Description copied from class: IByteList
      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 IByteList
      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
    • doAddSplitByteBlock

      private void doAddSplitByteBlock(int index, byte element, int pos, ByteBigList.ByteBlock newByteBlock)
    • modify

      private void modify(ByteBigList.ByteBlockNode node, int modify)
      Modify relativePosition of all nodes starting from the specified node.
      Parameters:
      node - node whose position value must be changed
      modify - modify value (>0 for add, invalid input: '<'0 for delete)
    • modifyLeftNode

      private void modifyLeftNode(ByteBigList.ByteBlockNode node, int modify)
    • modifyRightNode

      private void modifyRightNode(ByteBigList.ByteBlockNode node, int modify)
    • doRemove

    • doAddAll

      protected boolean doAddAll(int index, IByteListable list)
      Description copied from class: IByteList
      Helper method for adding multiple elements to the list. This default implementation calls doAdd() for adding each element.
      Overrides:
      doAddAll in class IByteList
      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
    • doAddAllTail

      private void doAddAllTail(IByteListable list, int addPos, int addLen, int space)
    • doAddAllHead

      private void doAddAllHead(IByteListable list, int addPos, int addLen, int space)
    • doAddAllMiddle

      private void doAddAllMiddle(IByteListable list, int addPos)
    • doClear

      protected void doClear()
      Overrides:
      doClear in class IByteList
    • doRemoveAll

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

      private void doRemoveAll2(int index, int len, int startPos, ByteBigList.ByteBlockNode startNode, ByteBigList.ByteBlockNode endNode)
    • merge

      private void merge(ByteBigList.ByteBlockNode node)
      Merge the specified node with the left or right neighbor if possible.
      Parameters:
      node - candidate node for merge
    • doRemove

      protected byte doRemove(int index)
      Description copied from class: IByteList
      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 IByteList
      Parameters:
      index - index of element to remove
      Returns:
      removed element
    • unmodifiableList

      public ByteBigList unmodifiableList()
      Specified by:
      unmodifiableList in class IByteList
    • immutableList

      public ByteBigList immutableList()
      Description copied from class: IByteList
      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 IByteList.unmodifiableList() to get unmodifiable view of a list.
      Specified by:
      immutableList in class IByteList
      Returns:
      an immutable copy of the specified list
    • doEnsureCapacity

      protected void doEnsureCapacity(int minCapacity)
      Description copied from class: IByteList
      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 IByteList
      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 IByteList
    • doCreate

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

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

      public int binarySearch(int index, int len, byte key)
      Description copied from class: IByteList
      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 IByteList
      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:
    • writeObject

      private void writeObject(ObjectOutputStream oos) throws IOException
      Serialize a ByteBigList object.
      Parameters:
      oos - output stream for serialization
      Throws:
      IOException - if serialization fails
    • readObject

      private void readObject(ObjectInputStream ois) throws IOException, ClassNotFoundException
      Deserialize a ByteBigList object.
      Parameters:
      ois - input stream for serialization
      Throws:
      IOException - if serialization fails
      ClassNotFoundException - if serialization fails
    • checkNode

      private void checkNode(ByteBigList.ByteBlockNode node)
    • checkHeight

      private void checkHeight(ByteBigList.ByteBlockNode node)
    • check

      private void check()