PUBLIC

DArray1dBodyC::DArray1dBodyC(void) DArray1dBodyC::DArray1dBodyC(IndexRangeC) DArray1dBodyC::DArray1dBodyC(SizeT) DArray1dBodyC::DArray1dBodyC(SizeT,bool) DArray1dBodyC::DArray1dBodyC(const Array1dC &) DArray1dBodyC::DArray1dBodyC(const SArray1dC &) DArray1dBodyC::Copy(void) const DArray1dBodyC::Index(IndexC) DArray1dBodyC::Index(IndexC) const DArray1dBodyC::Nth(UIntT) DArray1dBodyC::Nth(UIntT) const DArray1dBodyC::Append(const Array1dC &) DArray1dBodyC::Append(const DArray1dC &) DArray1dBodyC::Append(const DataT &) DArray1dBodyC::Remove(IndexC) DArray1dBodyC::Remove(IndexC,IndexC) DArray1dBodyC::RemoveFirst(void) DArray1dBodyC::RemoveLast(void) DArray1dBodyC::Contains(IndexC) const DArray1dBodyC::Fill(const DataT &) DArray1dBodyC::Range(void) const DArray1dBodyC::IMax(void) const DArray1dBodyC::IMin(void) const DArray1dBodyC::IsEmpty(void) const DArray1dBodyC::Empty(void) DArray1dBodyC::Size(void) const DArray1dBodyC::First(void) DArray1dBodyC::First(void) const DArray1dBodyC::Last(void) DArray1dBodyC::Last(void) const DArray1dBodyC::FindChunk(int,IntrDLIterC> &) const DArray1dBodyC::FindNthChunk(UIntT,UIntT &,IntrDLIterC> &) const RCBodyC::References(void) const RCBodyC::Copy(void) const RCBodyC::DeepCopy(UIntT) const RCBodyC::IncRefCounter(void) RCBodyC::DecRefCounter(void)

public RCBodyC

IntrDListC> chunks;

Some extra stuff to make appending single items faster.

Array1dC lastBlk;

IndexC nextFree;

UIntT allocBlocksize;

DArray1dBodyC()

Default constructor.

DArray1dBodyC(IndexRangeC range)

Constructor an array with a range allocated.

DArray1dBodyC(SizeT size)

Constructor an array with size elements allocated.

DArray1dBodyC(SizeT size,bool preAlloc)

Constructor an array with an expected size.
This is usefull if you know you'll be appending 'size' elements.

DArray1dBodyC(const Array1dC<DataT> & arr)

Construct from a normal array.

DArray1dBodyC(const SArray1dC<DataT> & arr)

Construct from a normal array.

DArray1dC<DataT> Copy() const

Make a copy of this DArray.

DataT & Index(IndexC i)

Find data item with that index.

const DataT & Index(IndexC i) const

Find data item with that index.

DataT & Nth(UIntT i)

Find the n'th entry, irrespective of index values.

const DataT & Nth(UIntT i) const

Find the n'th entry, irrespective of index values.

UIntT Append(const Array1dC<DataT> & newData)

Append data to this array.
Note the data is not copied! The number of items appended is returned.

UIntT Append(const DArray1dC<DataT> & newData)

Append data to this array.
Note the data is not copied! The number of items appended is returned.

IndexC Append(const DataT & newData)

Append data to this array.
Returns index of new item.

bool Remove(IndexC i)

Remove single entry from the array.

bool Remove(IndexC min,IndexC max)

Remove entries from min to max from the array.
This removes entries from min to max inclusively from the array.

bool RemoveFirst()

Remove first element from the array.

bool RemoveLast()

Remove last element from the array.

bool Contains(IndexC i) const

Test if container contains index.

void Fill(const DataT & value)

Fill array with given value.

IndexRangeC Range() const

Get range of indexes covered by array.
There may be holes in the range.

IndexC IMax() const

Maximum offset used.
If range is empty the results are undefined.

IndexC IMin() const

Minimum offset used.
If range is empty the results are undefined.

bool IsEmpty() const

Is array empty ?

void Empty()

Empty this array of all its contents.

UIntT Size() const

Find the number of elements in the DArray.
This doesn't count holes in the array.

At the moment this value is computed, this maybe a little slow for applications, and so maybe changed later.

DataT & First()

Access first element in the array.

const DataT & First() const

Access first element in the array.

DataT & Last()

Access last element in the array.

const DataT & Last() const

Access last element in the array.

bool FindChunk(int i,IntrDLIterC<DChunkC<DataT>> & it) const

Find the chunk containing the interest.

bool FindNthChunk(UIntT i,UIntT & at,IntrDLIterC<DChunkC<DataT>> & it) const

Find the chunk containing the interest.

UIntT References() const

Access count of handles open to this object.

RCBodyC & Copy() const

Make copy of body.
This should be provided in derived classes. this funtion will issue an assertion failure if called.

RCBodyC & DeepCopy(UIntT levels = ((UIntT))) const

Make a deep copy of body.
This should be provided in derived classes. this funtion will issue an assertion failure if called.

void IncRefCounter()

Increment reference counter.

bool DecRefCounter()

Decrement reference counter.