#include <vbl_sparse_array_1d.h>
Inheritance diagram for vbl_sparse_array_1d< T >:

Definition at line 23 of file vbl_sparse_array_1d.h.
Public Types | |
| typedef vbl_sparse_array_base< T, unsigned >::const_iterator | const_iterator |
| The type of iterators into the efficient storage. | |
| typedef unsigned | Index_type |
| The type of objects used to index the sparse array. | |
| typedef T | T_type |
| The type of values stored by the sparse array. | |
| typedef Map::value_type | sequence_value_type |
| The type of values of the controlled sequence. | |
Public Member Functions | |
| vcl_ostream & | print (vcl_ostream &out) const |
| Print the Array to a stream in "(i,j): value" format. | |
| T & | operator() (unsignedi) |
| Return contents at (i). | |
| Tconst & | operator() (unsignedi) const |
| Return contents at (i). Asserts if (i) empty. | |
| void | erase (unsigned) |
| Erase element at location (i). Assertion failure if not yet filled. | |
| bool | fullp (unsigned) const |
| Return true if location (i) has been filled. | |
| bool | put (unsigned, const T &) |
| Put a value into location (i). | |
| T * | get_addr (unsigned) |
| Return the address of location (i). 0 if not yet filled. | |
| void | clear () |
| Empty the sparse matrix. | |
| unsigned | count_nonempty () const |
| Return number of locations that have been assigned a value using "put". | |
| const_iterator | begin () const |
| A bidirectional iterator pointing at the first non-empty element. | |
| const_iterator | end () const |
| A bidirectional iterator pointing just beyond last non-empty element. | |
Protected Types | |
| typedef vcl_map< unsigned, T, vcl_less< unsigned > > | Map |
| The type of the storage. | |
Protected Attributes | |
| Map | storage_ |
| This stores a compact list of the values. | |
|
|||||
|
The type of iterators into the efficient storage.
Reimplemented from vbl_sparse_array_base< T, unsigned >. Definition at line 26 of file vbl_sparse_array_1d.h. |
|
|
The type of objects used to index the sparse array.
Definition at line 75 of file vbl_sparse_array_base.h. |
|
|
The type of the storage.
Definition at line 41 of file vbl_sparse_array_base.h. |
|
|
The type of values of the controlled sequence. The value_type is a vcl_pair<Index_type, typename T_type> Definition at line 82 of file vbl_sparse_array_base.h. |
|
|
The type of values stored by the sparse array.
Definition at line 78 of file vbl_sparse_array_base.h. |
|
|
A bidirectional iterator pointing at the first non-empty element. If the array is empty it points just beyond the end. Definition at line 86 of file vbl_sparse_array_base.h. |
|
|
Empty the sparse matrix.
|
|
|
Return number of locations that have been assigned a value using "put".
Definition at line 72 of file vbl_sparse_array_base.h. |
|
|
A bidirectional iterator pointing just beyond last non-empty element.
Definition at line 89 of file vbl_sparse_array_base.h. |
|
|
Erase element at location (i). Assertion failure if not yet filled.
|
|
|
Return true if location (i) has been filled.
|
|
|
Return the address of location (i). 0 if not yet filled.
|
|
|
Return contents at (i). Asserts if (i) empty.
|
|
|
Return contents at (i).
Definition at line 48 of file vbl_sparse_array_base.h. |
|
||||||||||
|
Print the Array to a stream in "(i,j): value" format.
Definition at line 29 of file vbl_sparse_array_1d.h. |
|
||||||||||||
|
Put a value into location (i).
|
|
|
This stores a compact list of the values.
Definition at line 43 of file vbl_sparse_array_base.h. |
1.4.4