CppAD: A C++ Algorithmic Differentiation Package
20171217
|
|
inline |
Change number of sets, set end, and initialize all sets as empty.
If n_set
is zero, any memory currently allocated for this object is freed. Otherwise, new memory may be allocated for the sets (if needed).
n_set | is the number of sets in this vector of sets. |
end | is the maximum element plus one. The minimum element is 0 and end must be greater than zero (unless n_set is also zero). If n_set is zero, end must also be zero. |
Definition at line 149 of file sparse_pack.hpp.
Referenced by CppAD::ADFun< Base >::for_hes_sparsity(), CppAD::ADFun< Base >::ForSparseHesCase(), CppAD::parallel_ad(), CppAD::ADFun< Base >::rev_hes_sparsity(), CppAD::ADFun< Base >::rev_jac_sparsity(), CppAD::ADFun< Base >::RevSparseHesCase(), CppAD::ADFun< Base >::RevSparseJacCase(), and CppAD::ADFun< double >::size_forward_bool().