CppAD: A C++ Algorithmic Differentiation Package
20171217
|
Vector of sets of positive integers stored as singly linked lists with the element values strictly increasing. More...
Go to the source code of this file.
Classes | |
struct | CppAD::local::sparse_list::pair_size_t |
type used for each entry in a singly linked list. More... | |
class | CppAD::local::sparse_list |
Vector of sets of positive integers, each set stored as a singly linked list. More... | |
class | CppAD::local::sparse_list_const_iterator |
cons_iterator for one set of positive integers in a sparse_list object. More... | |
Namespaces | |
CppAD | |
contains all the variables and functions defined by the CppAD package. | |
CppAD::local | |
Functions | |
template<> | |
bool | CppAD::local::is_pod< sparse_list::pair_size_t > (void) |
template<class VectorSet > | |
void | CppAD::local::sparsity_user2internal (sparse_list &internal, const VectorSet &user, size_t n_set, size_t end, bool transpose, const char *error_msg) |
Copy a user vector of sets sparsity pattern to an internal sparse_list object. More... | |
Vector of sets of positive integers stored as singly linked lists with the element values strictly increasing.
Definition in file sparse_list.hpp.