CppAD: A C++ Algorithmic Differentiation Package
20171217
|
cons_iterator for one set of positive integers in a sparse_list object. More...
Public Member Functions | |
size_t | operator* (void) |
obtain value of this element of the set of positive integers (end_ for no such element) More... | |
sparse_list_const_iterator & | operator++ (void) |
advance to next element in this list More... | |
sparse_list_const_iterator (const sparse_list &list, size_t i) | |
construct a const_iterator for a list in a sparse_list object More... | |
Private Types | |
typedef sparse_list::pair_size_t | pair_size_t |
type used by sparse_list to represent one element of the list More... | |
Private Attributes | |
const pod_vector< pair_size_t > & | data_ |
data for the entire vector of sets More... | |
const size_t | end_ |
Possible elements in a list are 0, 1, ..., end_ - 1;. More... | |
pair_size_t | next_pair_ |
next element in the singly linked list (next_pair_.value == end_ for past end of list) More... | |
cons_iterator for one set of positive integers in a sparse_list object.
All the public members for this class are also in the sparse_pack_const_iterator and sparse_sizevec_const_iterator classes. This defines the CppAD vector_of_sets iterator concept.
Definition at line 1312 of file sparse_list.hpp.