Changeset 3108 for trunk/test_more


Ignore:
Timestamp:
Feb 20, 2014 8:51:45 AM (6 years ago)
Author:
bradbell
Message:

sparse_jacobian.hpp: sort by color (simpler and faster).
package.sh: do not include files in the new directories.
sparse_jacobian.cpp: add missing test of sparsity pattern argument.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • trunk/test_more/sparse_jacobian.cpp

    r2870 r3108  
    11/* $Id$ */
    22/* --------------------------------------------------------------------------
    3 CppAD: C++ Algorithmic Differentiation: Copyright (C) 2003-13 Bradley M. Bell
     3CppAD: C++ Algorithmic Differentiation: Copyright (C) 2003-14 Bradley M. Bell
    44
    55CppAD is distributed under multiple licenses. This distribution is under
     
    319319        }
    320320        p   = f.RevSparseJac(m, s);
    321         jac = f.SparseJacobian(x);
     321        jac = f.SparseJacobian(x, p);
    322322        for(k = 0; k < 12; k++)
    323323                ok &=  NearEqual(check[k], jac[k], 1e-10, 1e-10 );
     
    376376                s[i].insert(i);
    377377        p   = f.RevSparseJac(m, s);
    378         jac = f.SparseJacobian(x);
     378        jac = f.SparseJacobian(x, p);
    379379        for(k = 0; k < 12; k++)
    380380                ok &=  NearEqual(check[k], jac[k], 1e-10, 1e-10 );
     
    440440        }
    441441        p   = f.ForSparseJac(n, r);
    442         jac = f.SparseJacobian(x);
     442        jac = f.SparseJacobian(x, p);
    443443        for(k = 0; k < 12; k++)
    444444                ok &=  NearEqual(check[k], jac[k], 1e-10, 1e-10 );
     
    500500                r[j].insert(j);
    501501        p   = f.ForSparseJac(n, r);
    502         jac = f.SparseJacobian(x);
     502        jac = f.SparseJacobian(x, p);
    503503        for(k = 0; k < 12; k++)
    504504                ok &=  NearEqual(check[k], jac[k], 1e-10, 1e-10 );
Note: See TracChangeset for help on using the changeset viewer.