template<class Vector_set >

void CppAD::local::forward_sparse_jacobian_csum_op	(	size_t	i_z,
		const addr_t *	arg,
		Vector_set &	sparsity
	)

inline

Forward mode Jacobian sparsity pattern for CSumOp operator.

This operation is

     z = q + x(1) + ... + x(m) - y(1) - ... - y(n).

Template Parameters

Vector_set is the type used for vectors of sets. It can be either sparse_pack or sparse_list.

Parameters

i_z	variable index corresponding to the result for this operation; i.e. the index in sparsity corresponding to z.
arg	arg[0] is the number of addition variables in this cummulative summation; i.e., `m + n`. arg[1] is the number of subtraction variables in this cummulative summation; i.e., `m`. `parameter[ arg[2] ]` is the parameter value `q` in this cummunative summation. `arg[2+i]` for `i = 1 , ... , m` is the value `x(i)`. `arg[2+arg[1]+i]` for `i = 1 , ... , n` is the value `y(i)`.
sparsity	Input: For `i = 1 , ... , m`, the set with index arg[2+i] in sparsity is the sparsity bit pattern for `x(i)`. This identifies which of the independent variables the variable `x(i)` depends on. Input: For `i = 1 , ... , n`, the set with index arg[2+arg[0]+i] in sparsity is the sparsity bit pattern for `x(i)`. This identifies which of the independent variables the variable `y(i)` depends on. Output: The set with index i_z in sparsity is the sparsity bit pattern for z. This identifies which of the independent variables the variable z depends on.

Definition at line 425 of file csum_op.hpp.