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_list::start_

Starting point for i-th set is start_[i].

  • If the i-th set has no elements, start_[i] is zero. Otherwise the conditions below hold.
  • data_[ start_[i] ].value is the reference count for this list. This element is not in the list.
  • data_[ start_[i] ].next point the the first element in the list and is not zero because there is at least one entry in this list.
  • For all lists, the last pair in the list has data_ index zero, data_[0].value == end_ and data_[0].next = 0, and is not in the set.

Definition at line 83 of file sparse_list.hpp.

Referenced by add_element(), assignment(), binary_intersection(), binary_union(), check_data_structure(), clear(), drop(), is_element(), is_subset(), n_set(), number_elements(), operator=(), post_element(), reference_count(), resize(), and CppAD::local::sparse_list_const_iterator::sparse_list_const_iterator().