|
casa
$Rev:20696$
|
|
casa
$Rev:20696$
|
simple 1-D array More...
#include <Block.h>
Public Member Functions | |
| Block () | |
| Create a zero-length Block. | |
| Block (size_t n) | |
| Create a Block with the given number of points. | |
| Block (size_t n, T val) | |
| Create a Block of the given length, and initialize (via operator= for objects of type T) with the provided value. | |
| Block (size_t n, T *&storagePointer, Bool takeOverStorage=True) | |
Create a Block from a C-array (i.e. | |
| Block (const Block< T > &other) | |
| Copy the other block into this one. | |
| Block< T > & | operator= (const Block< T > &other) |
| Assign other to this. | |
| ~Block () | |
| Frees up the storage pointed contained in the Block. | |
| void | resize (size_t n, Bool forceSmaller=False, Bool copyElements=True) |
| Resizes the Block. | |
| void | remove (size_t whichOne, Bool forceSmaller=True) |
| Remove a single element from the Block. | |
| void | replaceStorage (size_t n, T *&storagePointer, Bool takeOverStorage=True) |
| Replace the internal storage with a C-array (i.e. | |
| T & | operator[] (size_t index) |
| Index into the block (0-based). | |
| const T & | operator[] (size_t index) const |
| Block< T > & | operator= (const T &val) |
| Set all values in the block to "val". | |
| void | set (const T &val) |
| T * | storage () |
| If you really, really, need a "raw" pointer to the beginning of the storage area this will give it to you. | |
| const T * | storage () const |
| size_t | nelements () const |
The number of elements contained in this Block<T>. | |
| size_t | size () const |
| Bool | empty () const |
| Is the block empty (i.e. | |
| typedef T | value_type |
| Define the STL-style iterators. | |
| typedef T * | iterator |
| typedef const T * | const_iterator |
| typedef value_type * | pointer |
| typedef const value_type * | const_pointer |
| typedef value_type & | reference |
| typedef const value_type & | const_reference |
| typedef size_t | size_type |
| typedef ptrdiff_t | difference_type |
| size_t | npts |
| T * | array |
| The actual storage. | |
| Bool | destroyPointer |
| Can we delete the storage upon destruction? | |
| iterator | begin () |
| Get the begin and end iterator object for this block. | |
| const_iterator | begin () const |
| iterator | end () |
| const_iterator | end () const |
simple 1-D array
Public interface
This should be viewed as a block of memory without sophisticated manipulation functions. Thus it is called Block.
Block<T> is a simple templated 1-D array class. Indices are always 0-based. For efficiency reasons, no index checking is done unless the preprocessor symbol AIPS_ARRAY_INDEX_CHECK is defined. Block<T>'s may be assigned to and constructed from other Block<T>'s. As no reference counting is done this can be an expensive operation, however.
The net effect of this class is meant to be unsurprising to users who think of arrays as first class objects. The name "Block" is intended to convey the concept of a solid "chunk" of things without any intervening "fancy" memory management, etc. This class was written to be used in the implementations of more functional Vector, Matrix, etc. classes, although it is expected Block<T> will be useful on its own.
The Block class should be efficient. You should normally use Block.
Warning: If you use the assignment operator on an element of this class, you may leave dangling references to pointers released from storage(); Resizing the array will also have this effect if the underlying storage is actually affected;
If index checking is turned on, an out-of-bounds index will generate an indexError<uInt> exception.
Block<Int> a(100,0); // 100 ints initialized to 0 Block<Int> b; // 0-length Block // ..\. b = a; // resize b and copy a into it for (size_t i=0; i < a.nelements(); i++) { a[i] = i; // Generate a sequence // with Vectors, could simply say "indgen(myVector);" } b.set(-1); // All positions in b have the value -1 b.resize(b.nelements()*2); // Make b twice as long, by default the old // elements are copied over, although this can // be defeated. some_c_function(b.storage()); // Use a fn that takes an // <tt>Int *</tt> pointer
| typedef const T* casa::Block< T >::const_iterator |
| typedef const value_type* casa::Block< T >::const_pointer |
| typedef const value_type& casa::Block< T >::const_reference |
| typedef ptrdiff_t casa::Block< T >::difference_type |
| typedef T* casa::Block< T >::iterator |
| typedef value_type* casa::Block< T >::pointer |
| typedef value_type& casa::Block< T >::reference |
| typedef size_t casa::Block< T >::size_type |
| typedef T casa::Block< T >::value_type |
Define the STL-style iterators.
It makes it possible to iterate through all data elements.
Block<Int> bl(100,0);
for (Block<Int>::iterator iter=bl.begin(); iter!=bl.end(); iter++) {
*iter += 1;
}
| casa::Block< T >::Block | ( | ) | [inline] |
| casa::Block< T >::Block | ( | size_t | n | ) | [inline, explicit] |
| casa::Block< T >::Block | ( | size_t | n, |
| T | val | ||
| ) | [inline] |
| casa::Block< T >::Block | ( | size_t | n, |
| T *& | storagePointer, | ||
| Bool | takeOverStorage = True |
||
| ) | [inline] |
| casa::Block< T >::Block | ( | const Block< T > & | other | ) | [inline] |
| casa::Block< T >::~Block | ( | ) | [inline] |
| iterator casa::Block< T >::begin | ( | ) | [inline] |
| const_iterator casa::Block< T >::begin | ( | ) | const [inline] |
| Bool casa::Block< T >::empty | ( | ) | const [inline] |
Is the block empty (i.e.
no elements)?
Definition at line 291 of file Block.h.
Referenced by casa::PtrBlock< Cube< Float > * >::empty().
| iterator casa::Block< T >::end | ( | ) | [inline] |
| const_iterator casa::Block< T >::end | ( | ) | const [inline] |
| size_t casa::Block< T >::nelements | ( | ) | const [inline] |
The number of elements contained in this Block<T>.
Definition at line 286 of file Block.h.
Referenced by casa::CompoundParam< AutoDiff< Double > >::CompoundParam(), casa::GenSort_global_functions_genSortInPlace::genSort(), casa::GenSort_global_functions_genSortIndirect::genSort(), casa::DisplayData::getFirstZIndex(), casa::MeasConvert< MEpoch >::isNOP(), casa::MeasureHolder::nelements(), casa::PtrBlock< Cube< Float > * >::nelements(), casa::SimpleOrderedMap< String, RefColumn * >::ntot(), casa::NewMultiTermFT::printFTTypes(), casa::BlockIO_global_functions_BlockIO::putBlock(), casa::MSAsRaster::resetFreq_(), casa::BlockIO_global_functions_BlockIO::showBlock(), and casa::MSAsRaster::spw_().
| Block<T>& casa::Block< T >::operator= | ( | const Block< T > & | other | ) | [inline] |
Assign other to this.
this resizes itself to the size of other, so after the assignment, this->nelements() == other.elements() always.
| Block<T>& casa::Block< T >::operator= | ( | const T & | val | ) | [inline] |
| T& casa::Block< T >::operator[] | ( | size_t | index | ) | [inline] |
Index into the block (0-based).
If the preprocessor symbol AIPS_ARRAY_INDEX_CHECK is defined, index checking will be done and an out-of-bounds index will cause an indexError<uInt> to be thrown. Note that valid indices range between 0 and nelements()-1.
| const T& casa::Block< T >::operator[] | ( | size_t | index | ) | const [inline] |
| void casa::Block< T >::remove | ( | size_t | whichOne, |
| Bool | forceSmaller = True |
||
| ) | [inline] |
Remove a single element from the Block.
If forceSmaller is True this will resize the Block and hence involve new memory allocations. This is relatively expensive so setting forceSmaller to False is preferred. When forcesmaller is False the Block is not resized but the elements with an index above the removed element are shuffled down by one. For backward compatibility forceSmaller is True by default.
Definition at line 188 of file Block.h.
Referenced by casa::PtrBlock< Cube< Float > * >::remove().
| void casa::Block< T >::replaceStorage | ( | size_t | n, |
| T *& | storagePointer, | ||
| Bool | takeOverStorage = True |
||
| ) | [inline] |
Replace the internal storage with a C-array (i.e.
pointer). If takeOverStorage is True, The Block assumes that it owns the pointer, i.e. that it is safe to delete[] it when the Blockis destructed, otherwise the actual storage is not destroyed. If true, storagePointer is set to NULL.
Definition at line 217 of file Block.h.
Referenced by casa::PtrBlock< Cube< Float > * >::replaceStorage().
| void casa::Block< T >::resize | ( | size_t | n, |
| Bool | forceSmaller = False, |
||
| Bool | copyElements = True |
||
| ) | [inline] |
Resizes the Block.
If n == nelements() resize just returns. If a larger size is requested (n > nelements()) the Block always resizes. If the requested size is smaller (n < nelements()), by default the Block does not resize smaller, although it can be forced to with forceSmaller. The reasoning behind this is that often the user will just want a buffer of at least a certain size, and won't want to pay the cost of multiple resizings.
Block<float> bf(100, 0.0);
bf.resize(10); // bf.nelements() == 100
bf.resize(10, True) // bf.nelements() == 10
bf.resize(200) // bf.nelements() == 200
Normally the old elements are copied over (although if the Block is lengthened the trailing elements will have undefined values), however this can be turned off by setting copyElements to False.
This is written as three functions because default parameters do not always work properly with templates.
Definition at line 163 of file Block.h.
Referenced by casa::Block< ArgType >::operator=(), casa::ConcatRows::reserve(), casa::MSAsRaster::resetFreq_(), and casa::PtrBlock< Cube< Float > * >::resize().
| void casa::Block< T >::set | ( | const T & | val | ) | [inline] |
Definition at line 262 of file Block.h.
Referenced by casa::PtrBlock< Cube< Float > * >::set().
| size_t casa::Block< T >::size | ( | ) | const [inline] |
Definition at line 287 of file Block.h.
Referenced by casa::PtrBlock< Cube< Float > * >::size().
| T* casa::Block< T >::storage | ( | ) | [inline] |
If you really, really, need a "raw" pointer to the beginning of the storage area this will give it to you.
This may leave dangling pointers if the block is destructed or if the assignment operator or resize is used. Returns a null pointer if nelements() == 0. It is best to only use this if you completely control the extent and lifetime of the Block.
Block<Int> *bp = new Block<Int>(100); Int *ip = bp->storage(); delete bp; // Oops, ip is now dangling Block<Int> a(100),b(100); Int *ip = a.storage(); a = b; // Likewise
Definition at line 280 of file Block.h.
Referenced by casa::PtrBlock< Cube< Float > * >::storage().
| const T* casa::Block< T >::storage | ( | ) | const [inline] |
T* casa::Block< T >::array [private] |
The actual storage.
Definition at line 331 of file Block.h.
Referenced by casa::Block< ArgType >::begin(), casa::Block< ArgType >::Block(), casa::Block< ArgType >::end(), casa::Block< ArgType >::operator=(), casa::Block< ArgType >::operator[](), casa::Block< ArgType >::remove(), casa::Block< ArgType >::replaceStorage(), casa::Block< ArgType >::resize(), casa::Block< ArgType >::storage(), and casa::Block< ArgType >::~Block().
Bool casa::Block< T >::destroyPointer [private] |
Can we delete the storage upon destruction?
Definition at line 333 of file Block.h.
Referenced by casa::Block< ArgType >::Block(), casa::Block< ArgType >::remove(), casa::Block< ArgType >::replaceStorage(), casa::Block< ArgType >::resize(), and casa::Block< ArgType >::~Block().
size_t casa::Block< T >::npts [private] |
The number of points in the vector
Definition at line 329 of file Block.h.
Referenced by casa::Block< ArgType >::Block(), casa::Block< ArgType >::empty(), casa::Block< ArgType >::end(), casa::Block< ArgType >::nelements(), casa::Block< ArgType >::operator=(), casa::Block< ArgType >::operator[](), casa::Block< ArgType >::remove(), casa::Block< ArgType >::replaceStorage(), casa::Block< ArgType >::resize(), and casa::Block< ArgType >::size().
1.8.0