template<class VectorSet >

void sparsity_user2internal	(	sparse_list &	internal,
		const VectorSet &	user,
		size_t	n_row,
		size_t	n_col,
		bool	transpose
	)

Copy a user vector of sets sparsity pattern to an internal sparse_list object.

Template Parameters:

VectorSet

is a simple vector with elements of type std::list<set>.

Parameters:

internal	The input value of sparisty does not matter. Upon return it contains the same sparsity pattern as user (or the transposed sparsity pattern).
user	sparsity pattern that we are placing internal.
n_row	number of rows in the sparsity pattern in user (range dimension).
n_col	number of columns in the sparsity pattern in user (domain dimension).
transpose	if true, the sparsity pattern in internal is the transpose of the one in user. Otherwise it is the same sparsity pattern.

Definition at line 382 of file sparse_list.hpp.

Referenced by ADFun< Base >::SparseHessianCase(), ADFun< Base >::SparseJacobian(), ADFun< Base >::SparseJacobianForward(), and ADFun< Base >::SparseJacobianReverse().