TDoubleArrayList

java.lang.Object
- com.slimjars.dist.gnu.trove.list.array.TDoubleArrayList

All Implemented Interfaces:

TDoubleList, TDoubleCollection, Externalizable, Serializable
```
public class TDoubleArrayList
extends Object
implements TDoubleList, Externalizable
```
A resizable, array-backed list of double primitives.

See Also:

Serialized Form

Field Summary

Fields

Modifier and Type	Field and Description
`protected double[]`	`_data` the data of the list
`protected int`	`_pos` the index after the last entry in the list
`protected static int`	`DEFAULT_CAPACITY` the default capacity for new lists
`protected double`	`no_entry_value` the double value that represents null

Constructor Summary

Constructors

Modifier	Constructor and Description
	`TDoubleArrayList()` Creates a new `TDoubleArrayList` instance with the default capacity.
	`TDoubleArrayList(double[] values)` Creates a new `TDoubleArrayList` instance whose capacity is the length of `values` array and whose initial contents are the specified values.
`protected`	`TDoubleArrayList(double[] values, double no_entry_value, boolean wrap)`
	`TDoubleArrayList(int capacity)` Creates a new `TDoubleArrayList` instance with the specified capacity.
	`TDoubleArrayList(int capacity, double no_entry_value)` Creates a new `TDoubleArrayList` instance with the specified capacity.
	`TDoubleArrayList(TDoubleCollection collection)` Creates a new `TDoubleArrayList` instance that contains a copy of the collection passed to us.

Method Summary

All Methods

Static Methods

Instance Methods

Concrete Methods
Modifier and Type	Method and Description
`boolean`	`add(double val)`
`void`	`add(double[] vals)`
`void`	`add(double[] vals, int offset, int length)`
`boolean`	`addAll(Collection<? extends Double> collection)`
`boolean`	`addAll(double[] array)`
`boolean`	`addAll(TDoubleCollection collection)`
`int`	`binarySearch(double value)`
`int`	`binarySearch(double value, int fromIndex, int toIndex)`
`void`	`clear()`
`void`	`clear(int capacity)` Flushes the internal state of the list, setting the capacity of the empty list to `capacity`.
`boolean`	`contains(double value)`
`boolean`	`containsAll(Collection<?> collection)`
`boolean`	`containsAll(double[] array)`
`boolean`	`containsAll(TDoubleCollection collection)`
`void`	`ensureCapacity(int capacity)` Grow the internal array as needed to accommodate the specified number of elements.
`boolean`	`equals(Object other)`
`void`	`fill(double val)`
`void`	`fill(int fromIndex, int toIndex, double val)`
`boolean`	`forEach(TDoubleProcedure procedure)`
`boolean`	`forEachDescending(TDoubleProcedure procedure)`
`double`	`get(int offset)`
`double`	`getNoEntryValue()`
`double`	`getQuick(int offset)` Returns the value at the specified offset without doing any bounds checking.
`TDoubleList`	`grep(TDoubleProcedure condition)`
`int`	`hashCode()`
`int`	`indexOf(double value)`
`int`	`indexOf(int offset, double value)`
`void`	`insert(int offset, double value)`
`void`	`insert(int offset, double[] values)`
`void`	`insert(int offset, double[] values, int valOffset, int len)`
`TDoubleList`	`inverseGrep(TDoubleProcedure condition)`
`boolean`	`isEmpty()`
`TDoubleIterator`	`iterator()`
`int`	`lastIndexOf(double value)`
`int`	`lastIndexOf(int offset, double value)`
`double`	`max()`
`double`	`min()`
`void`	`readExternal(ObjectInput in)`
`boolean`	`remove(double value)`
`void`	`remove(int offset, int length)`
`boolean`	`removeAll(Collection<?> collection)`
`boolean`	`removeAll(double[] array)`
`boolean`	`removeAll(TDoubleCollection collection)`
`double`	`removeAt(int offset)`
`double`	`replace(int offset, double val)`
`void`	`reset()` Sets the size of the list to 0, but does not change its capacity.
`void`	`resetQuick()` Sets the size of the list to 0, but does not change its capacity.
`boolean`	`retainAll(Collection<?> collection)`
`boolean`	`retainAll(double[] array)`
`boolean`	`retainAll(TDoubleCollection collection)`
`void`	`reverse()`
`void`	`reverse(int from, int to)`
`double`	`set(int offset, double val)`
`void`	`set(int offset, double[] values)`
`void`	`set(int offset, double[] values, int valOffset, int length)`
`void`	`setQuick(int offset, double val)` Sets the value at the specified offset without doing any bounds checking.
`void`	`shuffle(Random rand)`
`int`	`size()`
`void`	`sort()`
`void`	`sort(int fromIndex, int toIndex)`
`TDoubleList`	`subList(int begin, int end)`
`double`	`sum()`
`double[]`	`toArray()`
`double[]`	`toArray(double[] dest)`
`double[]`	`toArray(double[] dest, int offset, int len)`
`double[]`	`toArray(double[] dest, int source_pos, int dest_pos, int len)`
`double[]`	`toArray(int offset, int len)`
`String`	`toString()`
`void`	`transformValues(TDoubleFunction function)`
`void`	`trimToSize()` Sheds any excess capacity above and beyond the current size of the list.
`static TDoubleArrayList`	`wrap(double[] values)` Returns a primitive List implementation that wraps around the given primitive array.
`static TDoubleArrayList`	`wrap(double[] values, double no_entry_value)` Returns a primitive List implementation that wraps around the given primitive array.
`void`	`writeExternal(ObjectOutput out)`

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

Field Detail
- _data
```
protected double[] _data
```
  the data of the list
- _pos
```
protected int _pos
```
  the index after the last entry in the list
- DEFAULT_CAPACITY
```
protected static final int DEFAULT_CAPACITY
```
  the default capacity for new lists
  
  See Also:
  
  Constant Field Values
- no_entry_value
```
protected double no_entry_value
```
  the double value that represents null

Constructor Detail
- TDoubleArrayList
```
public TDoubleArrayList()
```
  Creates a new TDoubleArrayList instance with the default capacity.
- TDoubleArrayList
```
public TDoubleArrayList(int capacity)
```
  Creates a new TDoubleArrayList instance with the specified capacity.
  
  Parameters:
  
  capacity - an int value
- TDoubleArrayList
```
public TDoubleArrayList(int capacity,
                        double no_entry_value)
```
  Creates a new TDoubleArrayList instance with the specified capacity.
  
  Parameters:
  
  capacity - an int value
  
  no_entry_value - an double value that represents null.
- TDoubleArrayList
```
public TDoubleArrayList(TDoubleCollection collection)
```
  Creates a new TDoubleArrayList instance that contains a copy of the collection passed to us.
  
  Parameters:
  
  collection - the collection to copy
- TDoubleArrayList
```
public TDoubleArrayList(double[] values)
```
  Creates a new TDoubleArrayList instance whose capacity is the length of values array and whose initial contents are the specified values.
  A defensive copy of the given values is held by the new instance.
  
  Parameters:
  
  values - an double[] value
- TDoubleArrayList
```
protected TDoubleArrayList(double[] values,
                           double no_entry_value,
                           boolean wrap)
```

Method Detail

wrap
```
public static TDoubleArrayList wrap(double[] values)
```
Returns a primitive List implementation that wraps around the given primitive array.
NOTE: mutating operation are allowed as long as the List does not grow. In that case an IllegalStateException will be thrown

Parameters:

values -

Returns:

wrap
```
public static TDoubleArrayList wrap(double[] values,
                                    double no_entry_value)
```
Returns a primitive List implementation that wraps around the given primitive array.
NOTE: mutating operation are allowed as long as the List does not grow. In that case an IllegalStateException will be thrown

Parameters:

values -

no_entry_value -

Returns:

getNoEntryValue
```
public double getNoEntryValue()
```

ensureCapacity
```
public void ensureCapacity(int capacity)
```
Grow the internal array as needed to accommodate the specified number of elements. The size of the array bytes on each resize unless capacity requires more than twice the current capacity.

size
```
public int size()
```

isEmpty
```
public boolean isEmpty()
```

trimToSize
```
public void trimToSize()
```
Sheds any excess capacity above and beyond the current size of the list.

add
```
public boolean add(double val)
```

add
```
public void add(double[] vals)
```

add

public void add(double[] vals,
                int offset,
                int length)

insert

public void insert(int offset,
                   double value)

insert

public void insert(int offset,
                   double[] values)

insert

public void insert(int offset,
                   double[] values,
                   int valOffset,
                   int len)

get
```
public double get(int offset)
```

getQuick
```
public double getQuick(int offset)
```
Returns the value at the specified offset without doing any bounds checking.

set

public double set(int offset,
                  double val)

replace

public double replace(int offset,
                      double val)

set

public void set(int offset,
                double[] values)

set

public void set(int offset,
                double[] values,
                int valOffset,
                int length)

setQuick
```
public void setQuick(int offset,
                     double val)
```
Sets the value at the specified offset without doing any bounds checking.

clear
```
public void clear()
```

clear
```
public void clear(int capacity)
```
Flushes the internal state of the list, setting the capacity of the empty list to capacity.

reset
```
public void reset()
```
Sets the size of the list to 0, but does not change its capacity. This method can be used as an alternative to the clear() method if you want to recycle a list without allocating new backing arrays.

resetQuick
```
public void resetQuick()
```
Sets the size of the list to 0, but does not change its capacity. This method can be used as an alternative to the clear() method if you want to recycle a list without allocating new backing arrays. This method differs from reset() in that it does not clear the old values in the backing array. Thus, it is possible for getQuick to return stale data if this method is used and the caller is careless about bounds checking.

remove
```
public boolean remove(double value)
```

removeAt
```
public double removeAt(int offset)
```

remove

public void remove(int offset,
                   int length)

iterator
```
public TDoubleIterator iterator()
```

containsAll

public boolean containsAll(Collection<?> collection)

containsAll

public boolean containsAll(TDoubleCollection collection)

containsAll

public boolean containsAll(double[] array)

addAll

public boolean addAll(Collection<? extends Double> collection)

addAll

public boolean addAll(TDoubleCollection collection)

addAll

public boolean addAll(double[] array)

retainAll

public boolean retainAll(Collection<?> collection)

retainAll

public boolean retainAll(TDoubleCollection collection)

retainAll

public boolean retainAll(double[] array)

removeAll

public boolean removeAll(Collection<?> collection)

removeAll

public boolean removeAll(TDoubleCollection collection)

removeAll

public boolean removeAll(double[] array)

transformValues

public void transformValues(TDoubleFunction function)

reverse
```
public void reverse()
```

reverse

public void reverse(int from,
                    int to)

shuffle
```
public void shuffle(Random rand)
```

subList

public TDoubleList subList(int begin,
                           int end)

toArray
```
public double[] toArray()
```

toArray

public double[] toArray(int offset,
                        int len)

toArray

public double[] toArray(double[] dest)

toArray

public double[] toArray(double[] dest,
                        int offset,
                        int len)

toArray

public double[] toArray(double[] dest,
                        int source_pos,
                        int dest_pos,
                        int len)

equals
```
public boolean equals(Object other)
```

hashCode
```
public int hashCode()
```

forEach

public boolean forEach(TDoubleProcedure procedure)

forEachDescending

public boolean forEachDescending(TDoubleProcedure procedure)

sort
```
public void sort()
```

sort

public void sort(int fromIndex,
                 int toIndex)

fill
```
public void fill(double val)
```

fill

public void fill(int fromIndex,
                 int toIndex,
                 double val)

binarySearch

public int binarySearch(double value)

binarySearch

public int binarySearch(double value,
                        int fromIndex,
                        int toIndex)

indexOf
```
public int indexOf(double value)
```

indexOf

public int indexOf(int offset,
                   double value)

lastIndexOf
```
public int lastIndexOf(double value)
```

lastIndexOf

public int lastIndexOf(int offset,
                       double value)

contains

public boolean contains(double value)

grep

public TDoubleList grep(TDoubleProcedure condition)

inverseGrep

public TDoubleList inverseGrep(TDoubleProcedure condition)

max
```
public double max()
```

min
```
public double min()
```

sum
```
public double sum()
```

toString
```
public String toString()
```

writeExternal

public void writeExternal(ObjectOutput out)
                   throws IOException

Specified by:: writeExternal in interface Externalizable
Throws:: IOException

readExternal

public void readExternal(ObjectInput in)
                  throws IOException,
                         ClassNotFoundException

Specified by:: readExternal in interface Externalizable
Throws:: IOException; ClassNotFoundException

Class TDoubleArrayList

Field Summary

Fields

Constructor Summary

Constructors

Method Summary

Methods inherited from class java.lang.Object

Field Detail

_data

_pos

DEFAULT_CAPACITY

no_entry_value

Constructor Detail

TDoubleArrayList

TDoubleArrayList

TDoubleArrayList

TDoubleArrayList

TDoubleArrayList

TDoubleArrayList

Method Detail

wrap

wrap

getNoEntryValue

ensureCapacity

size

isEmpty

trimToSize

add

add

add

insert

insert

insert

get

getQuick

set

replace

set

set

setQuick

clear

clear

reset

resetQuick

remove

removeAt

remove

iterator

containsAll

containsAll

containsAll

addAll

addAll

addAll

retainAll

retainAll

retainAll

removeAll

removeAll

removeAll

transformValues

reverse

reverse

shuffle

subList

toArray

toArray

toArray

toArray

toArray

equals

hashCode

forEach

forEachDescending

sort

sort

fill

fill

binarySearch

binarySearch