|
| SparseRangeReal () |
| Default constructor.
|
|
agx::Bool | add (agx::NlmcpCallback *callback, agx::UInt localRow, agx::UInt numRows) |
| Add nl-callback to receive callbacks during solves.
|
|
void | beginNlAddScope (agx::UInt permutedMatrixRow, agx::UInt iterativeRow) |
| Begin scope where NlmcpCallback instances are added given permuted matrix row.
|
|
agx::UInt | endNlAddScope () |
| End 'add new nl-callbacks' scope.
|
|
const NlmcpCallbacks & | getCallbacks () const |
|
agx::UInt | getScopeIterativeRow () const |
|
agx::UInt | getScopePermutedMatrixRow () const |
|
agx::Bool | isBoundedByNlCallback (agx::UInt row, agx::UInt searchDepth) const |
|
int | load_hdf5 (const agx::String &filename, const agx::String &name) |
| read the array to file in hdf5 format, with given name.
|
|
int | load_hdf5 (void *group, const agx::String &name) |
| read the array from an hdf5 stream, here disguised as the void * pointer
|
|
int | save_hdf5 (const agx::String &filename, const agx::String &name) const |
| write the array to file in hdf5 format, with given name.
|
|
int | save_hdf5 (void *group, const agx::String &name) const |
| write the array to an hdf5 stream, here disguised as the void * pointer
|
|
void | sort () |
| Sort given 'index' in IndexedRangeReal and updates indices of added nl-callbacks.
|
|
| Vector (const ByteAllocator &allocator=ByteAllocator()) |
|
| Vector (const Vector< IndexedRangeReal, ByteAllocator > &other) |
|
| Vector (const_iterator first, const_iterator end, const ByteAllocator &allocator=ByteAllocator()) |
|
| Vector (size_t size, const IndexedRangeReal &value=IndexedRangeReal(), const ByteAllocator &allocator=ByteAllocator()) |
|
| Vector (std::initializer_list< IndexedRangeReal > values, const ByteAllocator &allocator=ByteAllocator()) |
|
| Vector (Vector< IndexedRangeReal, ByteAllocator > &&other) |
|
| ~Vector () |
|
ByteAllocator & | allocator () |
|
const ByteAllocator & | allocator () const |
|
IndexedRangeReal & | at (size_t index) const |
|
IndexedRangeReal & | back () const |
|
iterator | begin () |
|
const_iterator | begin () const |
|
void | clear (ClearPolicy policy=SHRINK_BUFFER_AVERAGED) |
| Remove all elements, optionally with maintained buffer allocation.
|
|
bool | contains (const IndexedRangeReal &element) const |
|
bool | contains (const T2 &element) const |
| Test if the vector contains a certain element.
|
|
iterator | end () |
|
const_iterator | end () const |
|
iterator | erase (iterator position) |
| STL erase functionality.
|
|
iterator | erase (iterator start, iterator end) |
|
void | erase (size_t index) |
| Erase elements using indices instead of iterators.
|
|
void | erase (size_t start, size_t end) |
|
iterator | eraseFast (const_iterator position) |
| Fast erase, replacing the erased element with the last element.
|
|
void | eraseFast (size_t index) |
|
size_t | find (const T2 &element) const |
| Find the index to a matching element, return size() if not found.
|
|
bool | findAndErase (const T2 &element, bool searchMultiple=false) |
| Find and erase an element.
|
|
IndexedRangeReal & | front () const |
|
IndexedRangeReal * | increment (size_t numElements=1) |
| Resize using a increment.
|
|
void | insert (const_iterator it, InputIterator first, InputIterator last) |
|
void | insert (const_iterator it, std::initializer_list< IndexedRangeReal > ilist) |
|
iterator | insert (iterator position, const IndexedRangeReal &value) |
|
void | insert (size_t index, const IndexedRangeReal &value) |
|
bool | operator!= (const Vector< IndexedRangeReal, ByteAllocator > &other) const |
|
Vector< IndexedRangeReal, ByteAllocator > & | operator= (const Vector< IndexedRangeReal, ByteAllocator > &other) |
|
bool | operator== (const Vector< IndexedRangeReal, ByteAllocator > &other) const |
| Compare with other vector, return true if same size and all pairs are equal.
|
|
IndexedRangeReal & | operator[] (size_t i) const |
|
void | pop_back () |
|
IndexedRangeReal * | ptr () |
| Get access to the internal data buffer.
|
|
const IndexedRangeReal * | ptr () const |
|
void | push_back (const IndexedRangeReal &value) |
|
void | push_back (const T2 &value) |
|
void | push_back (IndexedRangeReal &&value) |
|
reverse_iterator | rbegin () |
|
const_reverse_iterator | rbegin () const |
|
reverse_iterator | rend () |
|
const_reverse_iterator | rend () const |
|
void | reserve (size_t size) |
| Reserve capacity in the vector.
|
|
void | reserveAtLeast (size_t size) |
| Reserve capacity in the vector.
|
|
void | resize (size_t size) |
| Resize the vector, which then enables direct addressing using the bracket '[]' operator.
|
|
void | resize (size_t size, const IndexedRangeReal &value) |
|
void | shrink_to_fit () |
| Reduce the capacity of the vector to the actual size (number of elements)
|
|
void | swap (Vector &other) |
|
size_t | capacity () const |
| Returns the size of the memory are used by the container to store its elements.
|
|
bool | empty () const |
|
void * | ptr () |
|
const void * | ptr () const |
|
size_t | size () const |
|
Essentially a sparse array of bounds.
Definition at line 73 of file SparseTypes.h.