diff --git a/speed/adolc/det_lu.cpp b/speed/adolc/det_lu.cpp index 6c0588665..9f43a25cd 100644 --- a/speed/adolc/det_lu.cpp +++ b/speed/adolc/det_lu.cpp @@ -42,12 +42,12 @@ bool link_det_lu( return false; // ----------------------------------------------------- // setup - short tag = 0; // tape identifier - int keep = 1; // keep forward mode results in buffer - int m = 1; // number of dependent variables + short tag = 0; // tape identifier + int keep = 1; // keep forward mode results in buffer + int m = 1; // number of dependent variables int n = int(size * size); // number of independent variables - double f; // function value - int j; // temporary index + double f; // function value + int j; // temporary index // set up for thread_alloc memory allocator (fast and checks for leaks) using CppAD::thread_alloc; // the allocator diff --git a/speed/adolc/det_minor.cpp b/speed/adolc/det_minor.cpp index 333066d89..43bc10960 100644 --- a/speed/adolc/det_minor.cpp +++ b/speed/adolc/det_minor.cpp @@ -37,7 +37,7 @@ namespace { CppAD::det_by_minor a_det(size); // declare independent variables - int keep = 1; // keep forward mode results + int keep = 1; // keep forward mode results trace_on(tag, keep); CppAD::vector a_A(n); for(int j = 0; j < n; ++j) @@ -85,7 +85,7 @@ bool link_det_minor( int n = int(size * size); // // tape identifier - short tag = 0; + short tag = 0; // bool onetape = global_option["onetape"]; // ---------------------------------------------------------------------- @@ -126,7 +126,7 @@ bool link_det_minor( CppAD::uniform_01( size_t(n), matrix); // evaluate the determinant at the new matrix value - int keep = 1; // keep this forward mode result + int keep = 1; // keep this forward mode result double f; // function result zos_forward(tag, m, n, keep, matrix.data(), &f); diff --git a/speed/adolc/mat_mul.cpp b/speed/adolc/mat_mul.cpp index bf3a31ea2..d595a54f3 100644 --- a/speed/adolc/mat_mul.cpp +++ b/speed/adolc/mat_mul.cpp @@ -45,11 +45,11 @@ bool link_mat_mul( typedef adouble ADScalar; typedef ADScalar* ADVector; - short tag = 0; // tape identifier - int m = 1; // number of dependent variables + short tag = 0; // tape identifier + int m = 1; // number of dependent variables int n = int(size * size); // number of independent variables - double f; // function value - int j; // temporary index + double f; // function value + int j; // temporary index // set up for thread_alloc memory allocator (fast and checks for leaks) using CppAD::thread_alloc; // the allocator @@ -80,7 +80,7 @@ bool link_mat_mul( CppAD::uniform_01( size_t(n), mat); // declare independent variables - int keep = 1; // keep forward mode results + int keep = 1; // keep forward mode results trace_on(tag, keep); for(j = 0; j < n; j++) X[j] <<= mat[j]; @@ -100,7 +100,7 @@ bool link_mat_mul( CppAD::uniform_01( size_t(n), mat); // declare independent variables - int keep = 0; // do not keep forward mode results + int keep = 0; // do not keep forward mode results trace_on(tag, keep); for(j = 0; j < n; j++) X[j] <<= mat[j]; diff --git a/speed/adolc/ode.cpp b/speed/adolc/ode.cpp index 455fedaba..8dd163631 100644 --- a/speed/adolc/ode.cpp +++ b/speed/adolc/ode.cpp @@ -51,11 +51,11 @@ bool link_ode( typedef CppAD::vector DblVector; size_t i, j; - short tag = 0; // tape identifier - int keep = 0; // do not keep forward mode results - size_t p = 0; // use ode to calculate function values - size_t n = size; // number of independent variables - size_t m = n; // number of dependent variables + short tag = 0; // tape identifier + int keep = 0; // do not keep forward mode results + size_t p = 0; // use ode to calculate function values + size_t n = size; // number of independent variables + size_t m = n; // number of dependent variables ADVector X(n), Y(m); // independent and dependent variables DblVector f(m); // function value diff --git a/speed/adolc/poly.cpp b/speed/adolc/poly.cpp index 8248be991..eec1fc9d6 100644 --- a/speed/adolc/poly.cpp +++ b/speed/adolc/poly.cpp @@ -51,8 +51,8 @@ bool link_poly( int keep = 0; // do not keep forward mode results in buffer int m = 1; // number of dependent variables int n = 1; // number of independent variables - int d = 2; // highest derivative degree - double f; // function value + int d = 2; // highest derivative degree + double f; // function value // set up for thread_alloc memory allocator (fast and checks for leaks) using CppAD::thread_alloc; // the allocator diff --git a/speed/adolc/sparse_hessian.cpp b/speed/adolc/sparse_hessian.cpp index 2c3a143ab..3a7738957 100644 --- a/speed/adolc/sparse_hessian.cpp +++ b/speed/adolc/sparse_hessian.cpp @@ -88,7 +88,7 @@ bool link_sparse_hessian( CppAD::uniform_01( size_t(n), x); // declare independent variables - int keep = 0; // keep forward mode results + int keep = 0; // keep forward mode results trace_on(tag, keep); for(size_t j = 0; j < n; j++) a_x[j] <<= x[j]; @@ -124,7 +124,7 @@ bool link_sparse_hessian( CppAD::uniform_01( size_t(n), x); // declare independent variables - int keep = 0; // keep forward mode results + int keep = 0; // keep forward mode results trace_on(tag, keep); for(size_t j = 0; j < n; j++) a_x[j] <<= x[j]; diff --git a/speed/adolc/sparse_jacobian.cpp b/speed/adolc/sparse_jacobian.cpp index f588e4116..ceee610c9 100644 --- a/speed/adolc/sparse_jacobian.cpp +++ b/speed/adolc/sparse_jacobian.cpp @@ -40,7 +40,7 @@ namespace { typedef vector a_vector; void setup( // inputs - short tag , + short tag , size_t size , size_t m , const s_vector& row , @@ -55,7 +55,7 @@ namespace { double*& values ) { // independent variables CPPAD_ASSERT_UNKNOWN( size = x.size() ); - int keep = 0; // keep forward mode results + int keep = 0; // keep forward mode results trace_on(tag, keep); size_t n = size; a_vector a_x(n);