BooleanBigList

java.lang.Object
- org.magicwerk.brownies.collections.primitive.IBooleanList
- - org.magicwerk.brownies.collections.primitive.BooleanBigList

All Implemented Interfaces:

java.io.Serializable, java.lang.Cloneable
```
public class BooleanBigList
extends IBooleanList
```
BooleanBigList 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 BooleanBigList 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 BooleanBigList is accessed by several threads at different positions.
Note that the iterators provided are not fail-fast.

Version:

$Id: BooleanBigList.java 2964 2015-10-18 22:43:57Z origo $

Author:

Thomas Mauch

See Also:
Serialized Form

Constructor Summary

Constructors
Constructor and Description
`BooleanBigList()` Default constructor.
`BooleanBigList(java.util.Collection<java.lang.Boolean> coll)` Create new list with specified elements.
`BooleanBigList(int blockSize)` Constructor.

Method Summary

Methods
Modifier and Type	Method and Description
`int`	`binarySearch(int index, int len, boolean key)` Searches the specified range for an object using the binary search algorithm.
`int`	`blockSize()` Returns block size used for this BooleanBigList.
`int`	`capacity()` As BooleanBigList grows and shrinks automatically, the term capacity does not really make sense.
`java.lang.Object`	`clone()` Returns a shallow copy of this `BooleanBigList` instance The copy is realized by a copy-on-write approach so also really large lists can efficiently be copied.
`BooleanBigList`	`copy()` Returns a copy of this `BooleanBigList` instance.
`static BooleanBigList`	`create()` Create new list.
`static BooleanBigList`	`create(boolean... elems)` Create new list with specified elements.
`static BooleanBigList`	`create(java.util.Collection<java.lang.Boolean> coll)` Create new list with specified elements.
`static BooleanBigList`	`EMPTY()`
`boolean`	`getDefaultElem()`
`static IBooleanList`	`of(boolean[] values)`
`static IBooleanList`	`of(java.lang.Boolean[] values)`
`static IBooleanList`	`of(java.util.List<java.lang.Boolean> values)`
`int`	`size()`
`void`	`sort(int index, int len)` Sort specified elements in the list using the specified comparator.
`void`	`trimToSize()` Pack as many elements in the blocks as allowed.
`BooleanBigList`	`unmodifiableList()` Returns an unmodifiable view of this list.

Methods inherited from class org.magicwerk.brownies.collections.primitive.IBooleanList
add, add, addAll, addAll, addAll, addAll, addArray, addArray, addFirst, addIfAbsent, addLast, addMult, addMult, binarySearch, clear, contains, containsAll, containsAny, copy, drag, element, ensureCapacity, equals, extract, extractWhere, fill, filter, get, getAll, getAll, getArray, getCount, getDistinct, getFirst, getLast, getWhere, hashCode, indexOf, indexOf, initAll, initAll, initArray, initMult, isEmpty, lastIndexOf, lastIndexOf, mappedList, move, offer, offerFirst, offerLast, peek, peekFirst, peekLast, poll, pollFirst, pollLast, pop, push, put, putAll, putAll, putArray, putMult, remove, remove, remove, removeAll, removeAll, removeAll, removeElem, removeFirst, removeFirstOccurrence, removeLast, removeLastOccurrence, removeWhere, replaceAll, replaceAll, replaceArray, replaceMult, resize, retainAll, retainAll, retainWhere, reverse, reverse, rotate, rotate, set, setAll, setAll, setArray, setMult, sort, swap, toArray, toArray, toArray, toString, transferCopy, transferMove, transferRemove, transferSwap

Methods inherited from class java.lang.Object
getClass, notify, notifyAll, wait, wait, wait

- Constructor Detail
  - BooleanBigList
```
public BooleanBigList()
```
    Default constructor. The default block size is used.
  - BooleanBigList
```
public BooleanBigList(int blockSize)
```
    Constructor.
    
    Parameters:
    blockSize - block size
  - BooleanBigList
```
public BooleanBigList(java.util.Collection<java.lang.Boolean> coll)
```
    Create new list with specified elements.
    
    Parameters:
    coll - collection with element
- Method Detail
  - of
```
public static IBooleanList of(boolean[] values)
```
  - of
```
public static IBooleanList of(java.lang.Boolean[] values)
```
  - of
```
public static IBooleanList of(java.util.List<java.lang.Boolean> values)
```
  - EMPTY
```
public static BooleanBigList EMPTY()
```
    Returns:
    unmodifiable empty instance
  - create
```
public static BooleanBigList create()
```
    Create new list.
    
    Parameters:
    type - of elements stored in the list
    
    Returns:
    created list
  - create
```
public static BooleanBigList create(java.util.Collection<java.lang.Boolean> 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 BooleanBigList create(boolean... 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 BooleanBigList.
    
    Returns:
    block size used for this BooleanBigList
  - copy
```
public BooleanBigList copy()
```
    Returns a copy of this BooleanBigList instance. The copy is realized by a copy-on-write approach so also really large lists can efficiently be copied. This method is identical to clone() except that the result is casted to BooleanBigList.
    
    Overrides:
    
    copy in class IBooleanList
    
    Returns:
    a copy of this BooleanBigList instance
    See Also:
    IBooleanList.clone()
  - clone
```
public java.lang.Object clone()
```
    Returns a shallow copy of this BooleanBigList instance The copy is realized by a copy-on-write approach so also really large lists can efficiently be copied.
    
    Overrides:
    
    clone in class IBooleanList
    
    Returns:
    a copy of this BooleanBigList instance
  - getDefaultElem
```
public boolean getDefaultElem()
```
  - size
```
public int size()
```
    Specified by:
    
    size in class IBooleanList
  - capacity
```
public int capacity()
```
    As BooleanBigList grows and shrinks automatically, the term capacity does not really make sense. Therefore always -1 is returned.
    
    Specified by:
    
    capacity in class IBooleanList
    
    Returns:
    capacity of this list
  - unmodifiableList
```
public BooleanBigList unmodifiableList()
```
    Description copied from class: IBooleanList
    
    Returns an unmodifiable view of this list. This method allows modules to provide users with "read-only" access to internal lists. Query operations on the returned list "read through" to the specified list, and attempts to modify the returned list, whether direct or via its iterator, result in an UnsupportedOperationException.
    
    Specified by:
    
    unmodifiableList in class IBooleanList
    
    Returns:
    an unmodifiable view of the specified list
  - 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 IBooleanList
  - sort
```
public void sort(int index,
        int len)
```
    Description copied from class: IBooleanList
    
    Sort specified elements in the list using the specified comparator.
    
    Specified by:
    
    sort in class IBooleanList
    
    Parameters:
    index - index of first element to sort
    len - number of elements to sort
    See Also:
    Arrays.sort(int[])
  - binarySearch
```
public int binarySearch(int index,
               int len,
               boolean key)
```
    Description copied from class: IBooleanList
    
    Searches the specified range for an object using the binary search algorithm.
    
    Specified by:
    
    binarySearch in class IBooleanList
    
    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:
    Arrays.binarySearch(long[], long)

Class BooleanBigList

Constructor Summary

Method Summary

Methods inherited from class org.magicwerk.brownies.collections.primitive.IBooleanList

Methods inherited from class java.lang.Object

Constructor Detail

BooleanBigList

BooleanBigList

BooleanBigList

Method Detail

of

of

of

EMPTY

create

create

create

blockSize

copy

clone

getDefaultElem

size

capacity

unmodifiableList

trimToSize

sort

binarySearch