CppAD: A C++ Algorithmic Differentiation Package  20171217
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
CppAD::local::sparse_pack_const_iterator Class Reference

cons_iterator for one set of positive integers in a sparse_pack object. More...

Public Member Functions

size_t operator* (void) const
 obtain value of this element of the set of positive integers (end_ for no such element) More...
 
sparse_pack_const_iteratoroperator++ (void)
 advance to next element in this set More...
 
 sparse_pack_const_iterator (const sparse_pack &pack, size_t set_index)
 construct a const_iterator for a set in a sparse_pack object More...
 

Private Types

typedef sparse_pack::Pack Pack
 Type used to pack elements in sparse_pack. More...
 

Private Attributes

const pod_vector< Pack > & data_
 data for the entire vector of sets More...
 
const size_t end_
 Possible elements in each set are 0, 1, ..., end_ - 1;. More...
 
const size_t n_bit_
 Number of bits per Pack value. More...
 
const size_t n_pack_
 Number of Pack values necessary to represent end_ bits. More...
 
size_t next_element_
 value of the next element in this set (use end_ for no such element exists; i.e., past end of the set). More...
 
const size_t set_index_
 index of this set in the vector of sets; More...
 

Detailed Description

cons_iterator for one set of positive integers in a sparse_pack object.

All the public members for this class are also in the sparse_list_const_iterator and sparse_sizevec_const_iterator classes. This defines the CppAD vector_of_sets iterator concept.

Definition at line 448 of file sparse_pack.hpp.


The documentation for this class was generated from the following file: