CppAD: A C++ Algorithmic Differentiation Package  20171217
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
pod_vector<size_t> CppAD::local::sparse_sizevec::post_
private

Vectors of elements that have not yet been added to corresponding sets.

  • If all the post_element calls for the i-th set have been added, post_[i] is zero. Otherwise the conditions below hold.
  • data_[ post_[i] ] the number of elements that have been posted, but not yet added, to set i.
  • data_[ post_[i] + 1 ] is the capacity for holding elements which is greater than or equal the number of elements.
  • data_[ post_[i] + 2 ] is the first element that has been posted, but not yet added, to set i.
  • data_[ post_[i] + 1 + n] is the last element that has been posted, but not yet added, to set i. Here n is the number of elements that are posted and not yet added to set i.

Definition at line 94 of file sparse_sizevec.hpp.

Referenced by assignment(), binary_intersection(), binary_union(), check_data_structure(), clear(), is_element(), number_elements(), operator=(), post_element(), process_post(), resize(), and CppAD::local::sparse_sizevec_const_iterator::sparse_sizevec_const_iterator().