Changeset 3747
- Timestamp:
- Nov 9, 2015 9:25:41 AM (4 years ago)
- Location:
- trunk
- Files:
-
- 4 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/bin/check_verbatim.sh
r3689 r3747 16 16 exit 1 17 17 fi 18 cat << EOF > junk.sed 19 /\$verbatim[^a-z]/! b skip 20 N 21 s/^#[ \\t]// 22 s/^[ \\t]// 23 s/\\n#[ \\t]// 24 s/\\n[ \\t]// 25 s/\$verbatim%// 26 s/%.*// 27 p 28 : skip 29 EOF 30 special_case=' 31 bin/check_include_omh.sh 32 bin/check_verbatim.sh 33 bin/package.sh 34 cppad/local/cond_exp.hpp 35 introduction/exp_apx/exp_2.omh 36 introduction/exp_apx/exp_eps.omh 37 omh/license.omh 38 ' 18 39 # ----------------------------------------------------------------------------- 19 40 # Make sure that OMhelp verbatim commands referr to same file as command 20 41 echo "Checking that OMhelp verbatim commands include from file they appear in." 21 42 echo "----------------------------------------------------------------------" 22 list=`bin/list_files.sh | sed -n \ 23 -e '/\.c$/p' \ 24 -e '/\.cpp$/p' \ 25 -e '/\.hpp$/p' \ 26 -e '/\.omh$/p' \ 27 -e '/\.txt$/p' \ 28 -e '/\.am$/p'` 43 list=`git ls-files` 29 44 different="no" 30 45 for file in $list 31 46 do 32 line=`sed -n -e '/$verbatim[^a-z]/p' $file` 33 if [ "$line" != '' ] 47 ok='no' 48 for name in $special_case 49 do 50 if [ "$file" == "$name" ] 51 then 52 ok='yes' 53 fi 54 done 55 # 56 reference=`sed -n -f junk.sed $file` 57 if [ "$reference" == '' ] || [ "$reference" == "$file" ] 34 58 then 35 reference=`echo $line | sed -e 's|$verbatim%\([^%]*\)%.*|\1|'`36 #37 file_root=`echo $file | sed \38 -e 's|.*/||' -e 's|_hpp\.omh||' -e 's|\.[^.]*$||'`39 #40 ref_root=`echo $reference | sed \41 -e 's|.*/||' -e 's|\.[^.]*$||'`42 #43 if [ "$file_root" != "$ref_root" ]59 ok='yes' 60 fi 61 # 62 ext=`echo $file | sed -e 's|.*\.||'` 63 if [ "$ext" == 'omh' ] 64 then 65 file_root=`echo $file | sed -e 's|.*/||' -e 's|_hpp\.omh|.hpp|'` 66 ref_root=`echo $reference | sed -e 's|.*/||'` 67 if [ "$file_root" == "$ref_root" ] 44 68 then 45 # special cases 46 ok='false' 47 if [ "$file_root" == 'cond_exp' ] && [ "$ref_root" == 'atan2' ] 48 then 49 ok='true' 50 fi 51 if [ "$file_root" == 'license' ] && [ "$ref_root" == 'epl-v10' ] 52 then 53 ok='true' 54 fi 55 if [ "$file_root"=='base_require' ] && [ "$ref_root"=='zdouble' ] 56 then 57 ok='true' 58 fi 59 # 60 if [ "$ok" == 'false' ] 61 then 62 echo "\$verbatim in $file references $reference" 63 different="yes" 64 fi 69 ok='yes' 65 70 fi 71 file_root=`echo $file | sed -e 's|.*/||' -e 's|\.omh|.hpp|'` 72 if [ "$file_root" == "$ref_root" ] 73 then 74 ok='yes' 75 fi 76 fi 77 # 78 if [ "$ok" == 'no' ] 79 then 80 echo "\$verbatim in $file references $reference" 81 different="yes" 66 82 fi 67 83 done … … 72 88 exit 1 73 89 else 74 echo "O k: nothing is between the two dashed lines above"90 echo "OK: nothing is between the two dashed lines above" 75 91 exit 0 76 92 fi -
trunk/example/bool_sparsity.cpp
r3746 r3747 17 17 $$ 18 18 19 $section Using vectorBool Sparsity Patterns: Example and Test$$ 20 21 $code 22 $verbatim%example/rev_sparse_hes.cpp%0%// BEGIN C++%// END C++%1%$$ 23 $$ 19 $section Using vectorBool Sparsity To Conserve Memory: Example and Test$$ 24 20 25 21 $head Purpose$$ 26 22 This example show how to conserve memory when computing sparsity patterns. 23 24 $code 25 $verbatim%example/bool_sparsity.cpp%0%// BEGIN C++%// END C++%1%$$ 26 $$ 27 27 28 28 $end … … 37 37 using CppAD::ADFun; 38 38 39 // function f(x) that we are computing sparsity patterns for 39 40 template <class Float> 40 41 vector<Float> fun(const vector<Float>& x) … … 48 49 return ret; 49 50 } 51 // check sparsity pattern for f(x) 50 52 bool check_jac(const vectorBool& pattern, size_t n) 51 53 { bool ok = true; … … 61 63 return ok; 62 64 } 65 // check sparsity pattern for the Hessian of sum_i f_i(x) 63 66 bool check_hes(const vectorBool& pattern, size_t n) 64 67 { bool ok = true; … … 73 76 return ok; 74 77 } 78 // compute sparsity for Jacobian of f(x) using forward mode 75 79 bool for_sparse_jac(ADFun<double>& f) 76 80 { bool ok = true; … … 78 82 size_t m = f.Range(); 79 83 // 84 // number of columns of the sparsity patter to compute at a time 80 85 size_t n_col = vectorBool::bit_per_unit(); 81 86 vectorBool pattern(m * n), s(m * n_col), r(n * n_col); … … 100 105 return ok; 101 106 } 107 // compute sparsity for Jacobian of f(x) using reverse mode 102 108 bool rev_sparse_jac(ADFun<double>& f) 103 109 { bool ok = true; … … 105 111 size_t m = f.Range(); 106 112 // 113 // number of rows of the sparsity patter to compute at a time 107 114 size_t n_row = vectorBool::bit_per_unit(); 108 115 vectorBool pattern(m * n), s(n_row * n), r(n_row * m); … … 127 134 return ok; 128 135 } 136 // compute sparsity for Hessian of sum_i f_i (x) 129 137 bool rev_sparse_hes(ADFun<double>& f) 130 138 { bool ok = true; … … 132 140 size_t m = f.Range(); 133 141 // 142 // number of columns of the sparsity patter to compute at a time 134 143 size_t n_col = vectorBool::bit_per_unit(); 135 144 vectorBool pattern(n * n), r(n * n_col), h(n * n_col); … … 164 173 } 165 174 } 175 // driver for all of the cases above 166 176 bool bool_sparsity(void) 167 177 { bool ok = true; 168 178 // 179 // record the funcion 169 180 size_t n = 100; 170 181 size_t m = n + 1; … … 176 187 ADFun<double> f(x, y); 177 188 // 189 // run the three example / tests 178 190 ok &= for_sparse_jac(f); 179 191 ok &= rev_sparse_jac(f); -
trunk/test_more/num_limits.cpp
r3738 r3747 32 32 33 33 $code 34 $verbatim%example/num_limits.cpp%0%// BEGIN C++%// END C++%1%$$34 old verbatim%example/num_limits.cpp%0%// BEGIN C++%// END C++%1%$$ 35 35 $$ 36 36 -
trunk/test_more/romberg_one.cpp
r3733 r3747 24 24 25 25 $code 26 $verbatim%example/romberg_one.cpp%0%// BEGIN C++%// END C++%1%$$26 old verbatim%example/romberg_one.cpp%0%// BEGIN C++%// END C++%1%$$ 27 27 $$ 28 28
Note: See TracChangeset
for help on using the changeset viewer.