Tree @upstream/2015.00.00.7 (Download .tar.gz)
- ..
- __contents_xml.js
- __external_xml.js
- __index_xml.js
- __reference_xml.js
- __search_xml.js
- _a11c_bthread.cpp_xml.js
- _a11c_openmp.cpp_xml.js
- _a11c_pthread.cpp_xml.js
- _abort_recording.cpp_xml.js
- _abort_recording_xml.js
- _abs.cpp_xml.js
- _abs_xml.js
- _acos.cpp_xml.js
- _acosforward_xml.js
- _acosreverse_xml.js
- _ad_assign.cpp_xml.js
- _ad_assign_xml.js
- _ad_binary_xml.js
- _ad_ctor.cpp_xml.js
- _ad_ctor_xml.js
- _ad_fun.cpp_xml.js
- _ad_in_c.cpp_xml.js
- _ad_input.cpp_xml.js
- _ad_input_xml.js
- _ad_output.cpp_xml.js
- _ad_output_xml.js
- _ad_xml.js
- _add.cpp_xml.js
- _addeq.cpp_xml.js
- _adfun_xml.js
- _adolc_alloc_mat_xml.js
- _adolc_det_lu.cpp_xml.js
- _adolc_det_minor.cpp_xml.js
- _adolc_mat_mul.cpp_xml.js
- _adolc_ode.cpp_xml.js
- _adolc_poly.cpp_xml.js
- _adolc_prefix_xml.js
- _adolc_sparse_hessian.cpp_xml.js
- _adolc_sparse_jacobian.cpp_xml.js
- _advalued_xml.js
- _appendix_xml.js
- _arithmetic_xml.js
- _asin.cpp_xml.js
- _asinforward_xml.js
- _asinreverse_xml.js
- _atan.cpp_xml.js
- _atan2.cpp_xml.js
- _atan2_xml.js
- _atanforward_xml.js
- _atanreverse_xml.js
- _atomic_afun_xml.js
- _atomic_base_clear_xml.js
- _atomic_base_xml.js
- _atomic_ctor_xml.js
- _atomic_for_sparse_jac_xml.js
- _atomic_forward_xml.js
- _atomic_get_started.cpp_xml.js
- _atomic_hes_sparse.cpp_xml.js
- _atomic_mat_mul.cpp_xml.js
- _atomic_matrix_mul.hpp_xml.js
- _atomic_norm_sq.cpp_xml.js
- _atomic_option_xml.js
- _atomic_reciprocal.cpp_xml.js
- _atomic_rev_sparse_hes_xml.js
- _atomic_rev_sparse_jac_xml.js
- _atomic_reverse_xml.js
- _atomic_tangent.cpp_xml.js
- _atomic_xml.js
- _base_adolc.hpp_xml.js
- _base_alloc.hpp_xml.js
- _base_complex.hpp_xml.js
- _base_cond_exp_xml.js
- _base_double.hpp_xml.js
- _base_example_xml.js
- _base_float.hpp_xml.js
- _base_identical_xml.js
- _base_member_xml.js
- _base_ordered_xml.js
- _base_require.cpp_xml.js
- _base_require_xml.js
- _base_std_math_xml.js
- _bender_quad.cpp_xml.js
- _benderquad_xml.js
- _bib_xml.js
- _bool_fun.cpp_xml.js
- _boolfun_xml.js
- _boolvalued_xml.js
- _bugs_xml.js
- _capacity_order.cpp_xml.js
- _capacity_order_xml.js
- _change_const.cpp_xml.js
- _check_for_nan.cpp_xml.js
- _check_for_nan_xml.js
- _check_numeric_type.cpp_xml.js
- _check_simple_vector.cpp_xml.js
- _checknumerictype_xml.js
- _checkpoint.cpp_xml.js
- _checkpoint_xml.js
- _checksimplevector_xml.js
- _close.gif
- _closeblue.gif
- _cmake_check_xml.js
- _cmake_xml.js
- _colpack.cpp_xml.js
- _colpack_prefix_xml.js
- _compare.cpp_xml.js
- _compare_c_xml.js
- _compare_change.cpp_xml.js
- _compare_xml.js
- _comparechange_xml.js
- _complex_poly.cpp_xml.js
- _compute_assign_xml.js
- _cond_exp.cpp_xml.js
- _condexp_xml.js
- _conj_grad.cpp_xml.js
- _contents.js
- _contents_xml.htm
- _convert_xml.js
- _correct_det_by_minor_c_xml.js
- _cos.cpp_xml.js
- _cosh.cpp_xml.js
- _cppad_assert_xml.js
- _cppad_det_lu.cpp_xml.js
- _cppad_det_minor.cpp_xml.js
- _cppad_eigen.hpp_xml.js
- _cppad_ipopt_nlp_xml.js
- _cppad_mat_mul.cpp_xml.js
- _cppad_ode.cpp_xml.js
- _cppad_poly.cpp_xml.js
- _cppad_sparse_hessian.cpp_xml.js
- _cppad_sparse_jacobian.cpp_xml.js
- _cppad_testvector_xml.js
- _cppad_vector.cpp_xml.js
- _cppad_vector_xml.js
- _cppad_xml.js
- _dependent_xml.js
- _deprecated_xml.js
- _det_33.hpp_xml.js
- _det_33_xml.js
- _det_by_lu.cpp_xml.js
- _det_by_lu.hpp_xml.js
- _det_by_lu_xml.js
- _det_by_minor.cpp_xml.js
- _det_by_minor.hpp_xml.js
- _det_by_minor_c_xml.js
- _det_by_minor_xml.js
- _det_grad_33.hpp_xml.js
- _det_grad_33_xml.js
- _det_of_minor.cpp_xml.js
- _det_of_minor.hpp_xml.js
- _det_of_minor_c_xml.js
- _det_of_minor_xml.js
- _discrete_xml.js
- _div.cpp_xml.js
- _div_eq.cpp_xml.js
- _double_det_lu.cpp_xml.js
- _double_det_minor.cpp_xml.js
- _double_mat_mul.cpp_xml.js
- _double_ode.cpp_xml.js
- _double_poly.cpp_xml.js
- _double_sparse_hessian.cpp_xml.js
- _double_sparse_jacobian.cpp_xml.js
- _download_xml.js
- _drivers_xml.js
- _eigen_array.cpp_xml.js
- _eigen_det.cpp_xml.js
- _eigen_plugin.hpp_xml.js
- _eigen_prefix_xml.js
- _elapsed_seconds.cpp_xml.js
- _elapsed_seconds_c_xml.js
- _elapsed_seconds_xml.js
- _epsilon_xml.js
- _equal_op_seq.cpp_xml.js
- _equalopseq_xml.js
- _erf.cpp_xml.js
- _erf_forward_xml.js
- _erf_reverse_xml.js
- _erf_xml.js
- _error_handler.cpp_xml.js
- _errorhandler_xml.js
- _example.cpp_xml.js
- _example_xml.js
- _exampleutility_xml.js
- _exp.cpp_xml.js
- _exp_2.cpp_xml.js
- _exp_2.hpp_xml.js
- _exp_2_cppad_xml.js
- _exp_2_for0.cpp_xml.js
- _exp_2_for0_xml.js
- _exp_2_for1.cpp_xml.js
- _exp_2_for1_xml.js
- _exp_2_for2.cpp_xml.js
- _exp_2_for2_xml.js
- _exp_2_rev1.cpp_xml.js
- _exp_2_rev1_xml.js
- _exp_2_rev2.cpp_xml.js
- _exp_2_rev2_xml.js
- _exp_2_xml.js
- _exp_apx_main.cpp_xml.js
- _exp_eps.cpp_xml.js
- _exp_eps.hpp_xml.js
- _exp_eps_cppad_xml.js
- _exp_eps_for0.cpp_xml.js
- _exp_eps_for0_xml.js
- _exp_eps_for1.cpp_xml.js
- _exp_eps_for1_xml.js
- _exp_eps_for2.cpp_xml.js
- _exp_eps_for2_xml.js
- _exp_eps_rev1.cpp_xml.js
- _exp_eps_rev1_xml.js
- _exp_eps_rev2.cpp_xml.js
- _exp_eps_rev2_xml.js
- _exp_eps_xml.js
- _expforward_xml.js
- _expreverse_xml.js
- _external.xml
- _fadbad_det_lu.cpp_xml.js
- _fadbad_det_minor.cpp_xml.js
- _fadbad_mat_mul.cpp_xml.js
- _fadbad_ode.cpp_xml.js
- _fadbad_poly.cpp_xml.js
- _fadbad_prefix_xml.js
- _fadbad_sparse_hessian.cpp_xml.js
- _fadbad_sparse_jacobian.cpp_xml.js
- _faq_xml.js
- _for_one.cpp_xml.js
- _for_sparse_jac.cpp_xml.js
- _for_two.cpp_xml.js
- _forone_xml.js
- _forsparsejac_xml.js
- _fortwo_xml.js
- _forward.cpp_xml.js
- _forward_dir.cpp_xml.js
- _forward_dir_xml.js
- _forward_one_xml.js
- _forward_order.cpp_xml.js
- _forward_order_xml.js
- _forward_two_xml.js
- _forward_xml.js
- _forward_zero_xml.js
- _forwardtheory_xml.js
- _fun_assign.cpp_xml.js
- _fun_check.cpp_xml.js
- _funcheck_xml.js
- _funconstruct_xml.js
- _fundeprecated_xml.js
- _funeval_xml.js
- _general_xml.js
- _get_adolc.sh_xml.js
- _get_colpack.sh_xml.js
- _get_eigen.sh_xml.js
- _get_fadbad.sh_xml.js
- _get_ipopt.sh_xml.js
- _get_sacado.sh_xml.js
- _get_started.cpp_xml.js
- _glossary_xml.js
- _harmonic.cpp_xml.js
- _harmonic_time.cpp_xml.js
- _harmonic_work.cpp_xml.js
- _hes_lagrangian.cpp_xml.js
- _hes_lu_det.cpp_xml.js
- _hes_minor_det.cpp_xml.js
- _hes_times_dir.cpp_xml.js
- _hessian.cpp_xml.js
- _hessian_xml.js
- _image.gif
- _include_deprecated_xml.js
- _independent.cpp_xml.js
- _independent_xml.js
- _index.xml
- _index_sort.cpp_xml.js
- _index_sort_xml.js
- _install_xml.js
- _installunix_xml.js
- _integer.cpp_xml.js
- _integer_xml.js
- _interface2c.cpp_xml.js
- _interp_onetape.cpp_xml.js
- _interp_retape.cpp_xml.js
- _introduction_xml.js
- _ipopt_nlp_get_started.cpp_xml.js
- _ipopt_nlp_ode_check.cpp_xml.js
- _ipopt_nlp_ode_fast.hpp_xml.js
- _ipopt_nlp_ode_fast_xml.js
- _ipopt_nlp_ode_problem.hpp_xml.js
- _ipopt_nlp_ode_problem_xml.js
- _ipopt_nlp_ode_run.hpp_xml.js
- _ipopt_nlp_ode_simple.hpp_xml.js
- _ipopt_nlp_ode_simple_xml.js
- _ipopt_nlp_ode_xml.js
- _ipopt_ode_speed.cpp_xml.js
- _ipopt_prefix_xml.js
- _ipopt_solve_get_started.cpp_xml.js
- _ipopt_solve_ode_inverse.cpp_xml.js
- _ipopt_solve_retape.cpp_xml.js
- _ipopt_solve_xml.js
- _jac_lu_det.cpp_xml.js
- _jac_minor_det.cpp_xml.js
- _jacobian.cpp_xml.js
- _jacobian_xml.js
- _library_xml.js
- _license_xml.js
- _limits.cpp_xml.js
- _limits_xml.js
- _link_det_lu_xml.js
- _link_det_minor_xml.js
- _link_mat_mul_xml.js
- _link_ode_xml.js
- _link_poly_xml.js
- _link_sparse_hessian_xml.js
- _link_sparse_jacobian_xml.js
- _listallexamples_xml.js
- _log.cpp_xml.js
- _log10.cpp_xml.js
- _logforward_xml.js
- _logreverse_xml.js
- _lu_factor.cpp_xml.js
- _lu_factor.hpp_xml.js
- _lu_invert.cpp_xml.js
- _lu_invert.hpp_xml.js
- _lu_ratio.cpp_xml.js
- _lu_solve.cpp_xml.js
- _lu_solve.hpp_xml.js
- _lu_vec_ad.cpp_xml.js
- _lu_vec_ad_ok.cpp_xml.js
- _ludetandsolve_xml.js
- _lufactor_xml.js
- _luinvert_xml.js
- _luratio_xml.js
- _lusolve_xml.js
- _main_compare_c_xml.js
- _mat_sum_sq.cpp_xml.js
- _mat_sum_sq.hpp_xml.js
- _mat_sum_sq_xml.js
- _mathother_xml.js
- _memory_leak_xml.js
- _microsoft_timer_xml.js
- _mul.cpp_xml.js
- _mul_eq.cpp_xml.js
- _mul_level.cpp_xml.js
- _mul_level_adolc.cpp_xml.js
- _mul_level_adolc_ode.cpp_xml.js
- _mul_level_ode.cpp_xml.js
- _mul_level_xml.js
- _multi_newton.cpp_xml.js
- _multi_newton_time.cpp_xml.js
- _multi_newton_work.cpp_xml.js
- _multi_thread_xml.js
- _nan.cpp_xml.js
- _nan_xml.js
- _near_equal.cpp_xml.js
- _near_equal_ext.cpp_xml.js
- _nearequal_xml.js
- _nearequalext_xml.js
- _number_skip.cpp_xml.js
- _number_skip_xml.js
- _numeric_type.cpp_xml.js
- _numerictype_xml.js
- _ode_err_control.cpp_xml.js
- _ode_err_maxabs.cpp_xml.js
- _ode_evaluate.cpp_xml.js
- _ode_evaluate.hpp_xml.js
- _ode_evaluate_xml.js
- _ode_gear.cpp_xml.js
- _ode_gear_control.cpp_xml.js
- _ode_stiff.cpp_xml.js
- _ode_taylor.cpp_xml.js
- _odeerrcontrol_xml.js
- _odegear_xml.js
- _odegearcontrol_xml.js
- _old_atomic_xml.js
- _old_mat_mul.cpp_xml.js
- _old_mat_mul.hpp_xml.js
- _old_max_num_threads_xml.js
- _old_reciprocal.cpp_xml.js
- _old_tan.cpp_xml.js
- _old_usead_1.cpp_xml.js
- _old_usead_2.cpp_xml.js
- _omp_alloc.cpp_xml.js
- _omp_alloc_xml.js
- _omp_available_xml.js
- _omp_create_array_xml.js
- _omp_delete_array_xml.js
- _omp_efficient_xml.js
- _omp_free_available_xml.js
- _omp_get_memory_xml.js
- _omp_get_thread_num_xml.js
- _omp_in_parallel_xml.js
- _omp_inuse_xml.js
- _omp_max_num_threads_xml.js
- _omp_max_thread_xml.js
- _omp_return_memory_xml.js
- _open.gif
- _openblue.gif
- _opt_val_hes.cpp_xml.js
- _opt_val_hes_xml.js
- _optimize.cpp_xml.js
- _optimize_xml.js
- _par_var.cpp_xml.js
- _parallel_ad_xml.js
- _parvar_xml.js
- _pkgconfig_xml.js
- _poly.cpp_xml.js
- _poly.hpp_xml.js
- _poly_xml.js
- _pow.cpp_xml.js
- _pow_int.cpp_xml.js
- _pow_int_xml.js
- _pow_xml.js
- _preprocessor_xml.js
- _print_for_cout.cpp_xml.js
- _print_for_string.cpp_xml.js
- _printfor_xml.js
- _reference.xml
- _repeat_det_by_minor_c_xml.js
- _rev_one.cpp_xml.js
- _rev_sparse_hes.cpp_xml.js
- _rev_sparse_jac.cpp_xml.js
- _rev_two.cpp_xml.js
- _reverse_any.cpp_xml.js
- _reverse_any_xml.js
- _reverse_identity_xml.js
- _reverse_one.cpp_xml.js
- _reverse_one_xml.js
- _reverse_three.cpp_xml.js
- _reverse_two.cpp_xml.js
- _reverse_two_xml.js
- _reverse_xml.js
- _reversetheory_xml.js
- _revone_xml.js
- _revsparsehes_xml.js
- _revsparsejac_xml.js
- _revtwo_xml.js
- _romberg_one.cpp_xml.js
- _rombergmul.cpp_xml.js
- _rombergmul_xml.js
- _rombergone_xml.js
- _rosen34_xml.js
- _rosen_34.cpp_xml.js
- _runge45_1.cpp_xml.js
- _runge45_2.cpp_xml.js
- _runge45_xml.js
- _sacado_det_lu.cpp_xml.js
- _sacado_det_minor.cpp_xml.js
- _sacado_mat_mul.cpp_xml.js
- _sacado_ode.cpp_xml.js
- _sacado_poly.cpp_xml.js
- _sacado_prefix_xml.js
- _sacado_sparse_hessian.cpp_xml.js
- _sacado_sparse_jacobian.cpp_xml.js
- _search.xml.js
- _search_xml.htm
- _seq_property.cpp_xml.js
- _seq_property_xml.js
- _sign.cpp_xml.js
- _sign_xml.js
- _simple_ad_bthread.cpp_xml.js
- _simple_ad_openmp.cpp_xml.js
- _simple_ad_pthread.cpp_xml.js
- _simple_vector.cpp_xml.js
- _simplevector_xml.js
- _sin.cpp_xml.js
- _sincosforward_xml.js
- _sincosreverse_xml.js
- _sinh.cpp_xml.js
- _size_order_xml.js
- _sparse_hes_fun.cpp_xml.js
- _sparse_hes_fun.hpp_xml.js
- _sparse_hes_fun_xml.js
- _sparse_hessian.cpp_xml.js
- _sparse_hessian_xml.js
- _sparse_jac_fun.cpp_xml.js
- _sparse_jac_fun.hpp_xml.js
- _sparse_jac_fun_xml.js
- _sparse_jacobian.cpp_xml.js
- _sparse_jacobian_xml.js
- _sparse_xml.js
- _speed_adolc_xml.js
- _speed_cppad_xml.js
- _speed_double_xml.js
- _speed_example.cpp_xml.js
- _speed_fadbad_xml.js
- _speed_main_xml.js
- _speed_program.cpp_xml.js
- _speed_sacado_xml.js
- _speed_test.cpp_xml.js
- _speed_test_xml.js
- _speed_utility_xml.js
- _speed_xml.js
- _speedtest_xml.js
- _sqrt.cpp_xml.js
- _sqrtforward_xml.js
- _sqrtreverse_xml.js
- _stack_machine.cpp_xml.js
- _std_math_ad_xml.js
- _sub.cpp_xml.js
- _sub_eq.cpp_xml.js
- _ta_available_xml.js
- _ta_create_array_xml.js
- _ta_delete_array_xml.js
- _ta_free_all_xml.js
- _ta_free_available_xml.js
- _ta_get_memory_xml.js
- _ta_hold_memory_xml.js
- _ta_in_parallel_xml.js
- _ta_inuse_xml.js
- _ta_num_threads_xml.js
- _ta_parallel_setup_xml.js
- _ta_return_memory_xml.js
- _ta_thread_num_xml.js
- _tan.cpp_xml.js
- _tan_forward_xml.js
- _tan_reverse_xml.js
- _tanh.cpp_xml.js
- _tape_index.cpp_xml.js
- _team_bthread.cpp_xml.js
- _team_example.cpp_xml.js
- _team_openmp.cpp_xml.js
- _team_pthread.cpp_xml.js
- _team_thread.hpp_xml.js
- _test_vector_xml.js
- _testvector_xml.js
- _theory_xml.js
- _thread_alloc.cpp_xml.js
- _thread_alloc_xml.js
- _thread_test.cpp_xml.js
- _time_det_by_minor_c_xml.js
- _time_test.cpp_xml.js
- _time_test_xml.js
- _tracknewdel.cpp_xml.js
- _tracknewdel_xml.js
- _unary_minus.cpp_xml.js
- _unary_plus.cpp_xml.js
- _unaryminus_xml.js
- _unaryplus_xml.js
- _uniform_01.hpp_xml.js
- _uniform_01_c_xml.js
- _uniform_01_xml.js
- _value.cpp_xml.js
- _value_xml.js
- _var2par.cpp_xml.js
- _var2par_xml.js
- _vec_ad.cpp_xml.js
- _vecad_xml.js
- _vector_bool.cpp_xml.js
- _whats_new_03_xml.js
- _whats_new_04_xml.js
- _whats_new_05_xml.js
- _whats_new_06_xml.js
- _whats_new_07_xml.js
- _whats_new_08_xml.js
- _whats_new_09_xml.js
- _whats_new_10_xml.js
- _whats_new_11_xml.js
- _whats_new_12_xml.js
- _whats_new_13_xml.js
- _whats_new_14_xml.js
- _whats_new_xml.js
- _wishlist_xml.js
- a11c_bthread.cpp.xml
- a11c_openmp.cpp.xml
- a11c_pthread.cpp.xml
- abort_recording.cpp.xml
- abort_recording.xml
- abs.cpp.xml
- abs.xml
- acos.cpp.xml
- acosforward.xml
- acosreverse.xml
- ad.xml
- ad_assign.cpp.xml
- ad_assign.xml
- ad_binary.xml
- ad_ctor.cpp.xml
- ad_ctor.xml
- ad_fun.cpp.xml
- ad_in_c.cpp.xml
- ad_input.cpp.xml
- ad_input.xml
- ad_output.cpp.xml
- ad_output.xml
- add.cpp.xml
- addeq.cpp.xml
- adfun.xml
- adolc_alloc_mat.xml
- adolc_det_lu.cpp.xml
- adolc_det_minor.cpp.xml
- adolc_mat_mul.cpp.xml
- adolc_ode.cpp.xml
- adolc_poly.cpp.xml
- adolc_prefix.xml
- adolc_sparse_hessian.cpp.xml
- adolc_sparse_jacobian.cpp.xml
- advalued.xml
- appendix.xml
- arithmetic.xml
- asin.cpp.xml
- asinforward.xml
- asinreverse.xml
- atan.cpp.xml
- atan2.cpp.xml
- atan2.xml
- atanforward.xml
- atanreverse.xml
- atomic.xml
- atomic_afun.xml
- atomic_base.xml
- atomic_base_clear.xml
- atomic_ctor.xml
- atomic_for_sparse_jac.xml
- atomic_forward.xml
- atomic_get_started.cpp.xml
- atomic_hes_sparse.cpp.xml
- atomic_mat_mul.cpp.xml
- atomic_matrix_mul.hpp.xml
- atomic_norm_sq.cpp.xml
- atomic_option.xml
- atomic_reciprocal.cpp.xml
- atomic_rev_sparse_hes.xml
- atomic_rev_sparse_jac.xml
- atomic_reverse.xml
- atomic_tangent.cpp.xml
- base_adolc.hpp.xml
- base_alloc.hpp.xml
- base_complex.hpp.xml
- base_cond_exp.xml
- base_double.hpp.xml
- base_example.xml
- base_float.hpp.xml
- base_identical.xml
- base_member.xml
- base_ordered.xml
- base_require.cpp.xml
- base_require.xml
- base_std_math.xml
- bender_quad.cpp.xml
- benderquad.xml
- bib.xml
- bool_fun.cpp.xml
- boolfun.xml
- boolvalued.xml
- bugs.xml
- capacity_order.cpp.xml
- capacity_order.xml
- change_const.cpp.xml
- check_for_nan.cpp.xml
- check_for_nan.xml
- check_numeric_type.cpp.xml
- check_simple_vector.cpp.xml
- checknumerictype.xml
- checkpoint.cpp.xml
- checkpoint.xml
- checksimplevector.xml
- cmake.xml
- cmake_check.xml
- colpack.cpp.xml
- colpack_prefix.xml
- compare.cpp.xml
- compare.xml
- compare_c.xml
- compare_change.cpp.xml
- comparechange.xml
- complex_poly.cpp.xml
- compute_assign.xml
- cond_exp.cpp.xml
- condexp.xml
- conj_grad.cpp.xml
- convert.xml
- correct_det_by_minor_c.xml
- cos.cpp.xml
- cosh.cpp.xml
- cppad.xml
- cppad_assert.xml
- cppad_det_lu.cpp.xml
- cppad_det_minor.cpp.xml
- cppad_eigen.hpp.xml
- cppad_ipopt_nlp.xml
- cppad_mat_mul.cpp.xml
- cppad_ode.cpp.xml
- cppad_poly.cpp.xml
- cppad_sparse_hessian.cpp.xml
- cppad_sparse_jacobian.cpp.xml
- cppad_testvector.xml
- cppad_vector.cpp.xml
- cppad_vector.xml
- dependent.xml
- deprecated.xml
- det_33.hpp.xml
- det_33.xml
- det_by_lu.cpp.xml
- det_by_lu.hpp.xml
- det_by_lu.xml
- det_by_minor.cpp.xml
- det_by_minor.hpp.xml
- det_by_minor.xml
- det_by_minor_c.xml
- det_grad_33.hpp.xml
- det_grad_33.xml
- det_of_minor.cpp.xml
- det_of_minor.hpp.xml
- det_of_minor.xml
- det_of_minor_c.xml
- discrete.xml
- div.cpp.xml
- div_eq.cpp.xml
- double_det_lu.cpp.xml
- double_det_minor.cpp.xml
- double_mat_mul.cpp.xml
- double_ode.cpp.xml
- double_poly.cpp.xml
- double_sparse_hessian.cpp.xml
- double_sparse_jacobian.cpp.xml
- download.xml
- drivers.xml
- eigen_array.cpp.xml
- eigen_det.cpp.xml
- eigen_plugin.hpp.xml
- eigen_prefix.xml
- elapsed_seconds.cpp.xml
- elapsed_seconds.xml
- elapsed_seconds_c.xml
- epsilon.xml
- equal_op_seq.cpp.xml
- equalopseq.xml
- erf.cpp.xml
- erf.xml
- erf_forward.xml
- erf_reverse.xml
- error.wrd
- error_handler.cpp.xml
- errorhandler.xml
- example.cpp.xml
- example.xml
- exampleutility.xml
- exp.cpp.xml
- exp_2.cpp.xml
- exp_2.hpp.xml
- exp_2.xml
- exp_2_cppad.xml
- exp_2_for0.cpp.xml
- exp_2_for0.xml
- exp_2_for1.cpp.xml
- exp_2_for1.xml
- exp_2_for2.cpp.xml
- exp_2_for2.xml
- exp_2_rev1.cpp.xml
- exp_2_rev1.xml
- exp_2_rev2.cpp.xml
- exp_2_rev2.xml
- exp_apx_main.cpp.xml
- exp_eps.cpp.xml
- exp_eps.hpp.xml
- exp_eps.xml
- exp_eps_cppad.xml
- exp_eps_for0.cpp.xml
- exp_eps_for0.xml
- exp_eps_for1.cpp.xml
- exp_eps_for1.xml
- exp_eps_for2.cpp.xml
- exp_eps_for2.xml
- exp_eps_rev1.cpp.xml
- exp_eps_rev1.xml
- exp_eps_rev2.cpp.xml
- exp_eps_rev2.xml
- expforward.xml
- expreverse.xml
- fadbad_det_lu.cpp.xml
- fadbad_det_minor.cpp.xml
- fadbad_mat_mul.cpp.xml
- fadbad_ode.cpp.xml
- fadbad_poly.cpp.xml
- fadbad_prefix.xml
- fadbad_sparse_hessian.cpp.xml
- fadbad_sparse_jacobian.cpp.xml
- faq.xml
- for_one.cpp.xml
- for_sparse_jac.cpp.xml
- for_two.cpp.xml
- forone.xml
- forsparsejac.xml
- fortwo.xml
- forward.cpp.xml
- forward.xml
- forward_dir.cpp.xml
- forward_dir.xml
- forward_one.xml
- forward_order.cpp.xml
- forward_order.xml
- forward_two.xml
- forward_zero.xml
- forwardtheory.xml
- fun_assign.cpp.xml
- fun_check.cpp.xml
- funcheck.xml
- funconstruct.xml
- fundeprecated.xml
- funeval.xml
- general.xml
- get_adolc.sh.xml
- get_colpack.sh.xml
- get_eigen.sh.xml
- get_fadbad.sh.xml
- get_ipopt.sh.xml
- get_sacado.sh.xml
- get_started.cpp.xml
- glossary.xml
- harmonic.cpp.xml
- harmonic_time.cpp.xml
- harmonic_work.cpp.xml
- hes_lagrangian.cpp.xml
- hes_lu_det.cpp.xml
- hes_minor_det.cpp.xml
- hes_times_dir.cpp.xml
- hessian.cpp.xml
- hessian.xml
- include_deprecated.xml
- independent.cpp.xml
- independent.xml
- index.html
- index_sort.cpp.xml
- index_sort.xml
- install.xml
- installunix.xml
- integer.cpp.xml
- integer.xml
- interface2c.cpp.xml
- interp_onetape.cpp.xml
- interp_retape.cpp.xml
- introduction.xml
- ipopt_nlp_get_started.cpp.xml
- ipopt_nlp_ode.xml
- ipopt_nlp_ode_check.cpp.xml
- ipopt_nlp_ode_fast.hpp.xml
- ipopt_nlp_ode_fast.xml
- ipopt_nlp_ode_problem.hpp.xml
- ipopt_nlp_ode_problem.xml
- ipopt_nlp_ode_run.hpp.xml
- ipopt_nlp_ode_simple.hpp.xml
- ipopt_nlp_ode_simple.xml
- ipopt_ode_speed.cpp.xml
- ipopt_prefix.xml
- ipopt_solve.xml
- ipopt_solve_get_started.cpp.xml
- ipopt_solve_ode_inverse.cpp.xml
- ipopt_solve_retape.cpp.xml
- jac_lu_det.cpp.xml
- jac_minor_det.cpp.xml
- jacobian.cpp.xml
- jacobian.xml
- library.xml
- license.xml
- limits.cpp.xml
- limits.xml
- link_det_lu.xml
- link_det_minor.xml
- link_mat_mul.xml
- link_ode.xml
- link_poly.xml
- link_sparse_hessian.xml
- link_sparse_jacobian.xml
- listallexamples.xml
- log.cpp.xml
- log10.cpp.xml
- logforward.xml
- logreverse.xml
- lu_factor.cpp.xml
- lu_factor.hpp.xml
- lu_invert.cpp.xml
- lu_invert.hpp.xml
- lu_ratio.cpp.xml
- lu_solve.cpp.xml
- lu_solve.hpp.xml
- lu_vec_ad.cpp.xml
- lu_vec_ad_ok.cpp.xml
- ludetandsolve.xml
- lufactor.xml
- luinvert.xml
- luratio.xml
- lusolve.xml
- main_compare_c.xml
- mat_sum_sq.cpp.xml
- mat_sum_sq.hpp.xml
- mat_sum_sq.xml
- mathother.xml
- memory_leak.xml
- microsoft_timer.xml
- mul.cpp.xml
- mul_eq.cpp.xml
- mul_level.cpp.xml
- mul_level.xml
- mul_level_adolc.cpp.xml
- mul_level_adolc_ode.cpp.xml
- mul_level_ode.cpp.xml
- multi_newton.cpp.xml
- multi_newton_time.cpp.xml
- multi_newton_work.cpp.xml
- multi_thread.xml
- nan.cpp.xml
- nan.xml
- near_equal.cpp.xml
- near_equal_ext.cpp.xml
- nearequal.xml
- nearequalext.xml
- number_skip.cpp.xml
- number_skip.xml
- numeric_type.cpp.xml
- numerictype.xml
- ode_err_control.cpp.xml
- ode_err_maxabs.cpp.xml
- ode_evaluate.cpp.xml
- ode_evaluate.hpp.xml
- ode_evaluate.xml
- ode_gear.cpp.xml
- ode_gear_control.cpp.xml
- ode_stiff.cpp.xml
- ode_taylor.cpp.xml
- odeerrcontrol.xml
- odegear.xml
- odegearcontrol.xml
- old_atomic.xml
- old_mat_mul.cpp.xml
- old_mat_mul.hpp.xml
- old_max_num_threads.xml
- old_reciprocal.cpp.xml
- old_tan.cpp.xml
- old_usead_1.cpp.xml
- old_usead_2.cpp.xml
- omp_alloc.cpp.xml
- omp_alloc.xml
- omp_available.xml
- omp_create_array.xml
- omp_delete_array.xml
- omp_efficient.xml
- omp_free_available.xml
- omp_get_memory.xml
- omp_get_thread_num.xml
- omp_in_parallel.xml
- omp_inuse.xml
- omp_max_num_threads.xml
- omp_max_thread.xml
- omp_return_memory.xml
- opt_val_hes.cpp.xml
- opt_val_hes.xml
- optimize.cpp.xml
- optimize.xml
- par_var.cpp.xml
- parallel_ad.xml
- parvar.xml
- pkgconfig.xml
- poly.cpp.xml
- poly.hpp.xml
- poly.xml
- pow.cpp.xml
- pow.xml
- pow_int.cpp.xml
- pow_int.xml
- preprocessor.xml
- print_for_cout.cpp.xml
- print_for_string.cpp.xml
- printfor.xml
- repeat_det_by_minor_c.xml
- rev_one.cpp.xml
- rev_sparse_hes.cpp.xml
- rev_sparse_jac.cpp.xml
- rev_two.cpp.xml
- reverse.xml
- reverse_any.cpp.xml
- reverse_any.xml
- reverse_identity.xml
- reverse_one.cpp.xml
- reverse_one.xml
- reverse_three.cpp.xml
- reverse_two.cpp.xml
- reverse_two.xml
- reversetheory.xml
- revone.xml
- revsparsehes.xml
- revsparsejac.xml
- revtwo.xml
- romberg_one.cpp.xml
- rombergmul.cpp.xml
- rombergmul.xml
- rombergone.xml
- rosen34.xml
- rosen_34.cpp.xml
- runge45.xml
- runge45_1.cpp.xml
- runge45_2.cpp.xml
- sacado_det_lu.cpp.xml
- sacado_det_minor.cpp.xml
- sacado_mat_mul.cpp.xml
- sacado_ode.cpp.xml
- sacado_poly.cpp.xml
- sacado_prefix.xml
- sacado_sparse_hessian.cpp.xml
- sacado_sparse_jacobian.cpp.xml
- seq_property.cpp.xml
- seq_property.xml
- sign.cpp.xml
- sign.xml
- simple_ad_bthread.cpp.xml
- simple_ad_openmp.cpp.xml
- simple_ad_pthread.cpp.xml
- simple_vector.cpp.xml
- simplevector.xml
- sin.cpp.xml
- sincosforward.xml
- sincosreverse.xml
- sinh.cpp.xml
- size_order.xml
- sparse.xml
- sparse_hes_fun.cpp.xml
- sparse_hes_fun.hpp.xml
- sparse_hes_fun.xml
- sparse_hessian.cpp.xml
- sparse_hessian.xml
- sparse_jac_fun.cpp.xml
- sparse_jac_fun.hpp.xml
- sparse_jac_fun.xml
- sparse_jacobian.cpp.xml
- sparse_jacobian.xml
- speed.xml
- speed_adolc.xml
- speed_cppad.xml
- speed_double.xml
- speed_example.cpp.xml
- speed_fadbad.xml
- speed_main.xml
- speed_program.cpp.xml
- speed_sacado.xml
- speed_test.cpp.xml
- speed_test.xml
- speed_utility.xml
- speedtest.xml
- sqrt.cpp.xml
- sqrtforward.xml
- sqrtreverse.xml
- stack_machine.cpp.xml
- std_math_ad.xml
- sub.cpp.xml
- sub_eq.cpp.xml
- ta_available.xml
- ta_create_array.xml
- ta_delete_array.xml
- ta_free_all.xml
- ta_free_available.xml
- ta_get_memory.xml
- ta_hold_memory.xml
- ta_in_parallel.xml
- ta_inuse.xml
- ta_num_threads.xml
- ta_parallel_setup.xml
- ta_return_memory.xml
- ta_thread_num.xml
- tan.cpp.xml
- tan_forward.xml
- tan_reverse.xml
- tanh.cpp.xml
- tape_index.cpp.xml
- team_bthread.cpp.xml
- team_example.cpp.xml
- team_openmp.cpp.xml
- team_pthread.cpp.xml
- team_thread.hpp.xml
- test_vector.xml
- testvector.xml
- theory.xml
- thread_alloc.cpp.xml
- thread_alloc.xml
- thread_test.cpp.xml
- time_det_by_minor_c.xml
- time_test.cpp.xml
- time_test.xml
- tracknewdel.cpp.xml
- tracknewdel.xml
- unary_minus.cpp.xml
- unary_plus.cpp.xml
- unaryminus.xml
- unaryplus.xml
- uniform_01.hpp.xml
- uniform_01.xml
- uniform_01_c.xml
- value.cpp.xml
- value.xml
- var2par.cpp.xml
- var2par.xml
- vec_ad.cpp.xml
- vecad.xml
- vector_bool.cpp.xml
- whats_new.xml
- whats_new_03.xml
- whats_new_04.xml
- whats_new_05.xml
- whats_new_06.xml
- whats_new_07.xml
- whats_new_08.xml
- whats_new_09.xml
- whats_new_10.xml
- whats_new_11.xml
- whats_new_12.xml
- whats_new_13.xml
- whats_new_14.xml
- wishlist.xml
simple_ad_bthread.cpp.xml @upstream/2015.00.00.7 — raw · history · blame
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 | <?xml version='1.0'?> <html xmlns='http://www.w3.org/1999/xhtml' xmlns:math='http://www.w3.org/1998/Math/MathML' > <head> <title>A Simple Boost Threading AD: Example and Test</title> <meta http-equiv='Content-Type' content='text/html' charset='utf-8'/> <meta name="description" id="description" content="A Simple Boost Threading AD: Example and Test"/> <meta name="keywords" id="keywords" content=" a simple boost threading ad: example and test thread Ad purpose source code "/> <style type='text/css'> body { color : black } body { background-color : white } A:link { color : blue } A:visited { color : purple } A:active { color : purple } </style> <script type='text/javascript' language='JavaScript' src='_simple_ad_bthread.cpp_xml.js'> </script> </head> <body> <table><tr> <td> <a href="http://www.coin-or.org/CppAD/" target="_top"><img border="0" src="_image.gif"/></a> </td> <td><a href="simple_ad_openmp.cpp.xml" target="_top">Prev</a> </td><td><a href="simple_ad_pthread.cpp.xml" target="_top">Next</a> </td><td> <select onchange='choose_across0(this)'> <option>Index-></option> <option>contents</option> <option>reference</option> <option>index</option> <option>search</option> <option>external</option> </select> </td> <td> <select onchange='choose_up0(this)'> <option>Up-></option> <option>CppAD</option> <option>multi_thread</option> <option>thread_test.cpp</option> <option>simple_ad_bthread.cpp</option> </select> </td> <td> <select onchange='choose_down3(this)'> <option>CppAD-></option> <option>Install</option> <option>Introduction</option> <option>AD</option> <option>ADFun</option> <option>preprocessor</option> <option>multi_thread</option> <option>library</option> <option>ipopt_solve</option> <option>Example</option> <option>speed</option> <option>Appendix</option> </select> </td> <td> <select onchange='choose_down2(this)'> <option>multi_thread-></option> <option>parallel_ad</option> <option>thread_test.cpp</option> </select> </td> <td> <select onchange='choose_down1(this)'> <option>thread_test.cpp-></option> <option>a11c_openmp.cpp</option> <option>a11c_bthread.cpp</option> <option>a11c_pthread.cpp</option> <option>simple_ad_openmp.cpp</option> <option>simple_ad_bthread.cpp</option> <option>simple_ad_pthread.cpp</option> <option>team_example.cpp</option> <option>harmonic.cpp</option> <option>multi_newton.cpp</option> <option>team_thread.hpp</option> </select> </td> <td>simple_ad_bthread.cpp</td> <td> <select onchange='choose_current0(this)'> <option>Headings-></option> <option>Purpose</option> <option>Source Code</option> </select> </td> </tr></table><br/> <center><b><big><big>A Simple Boost Threading AD: Example and Test</big></big></b></center> <br/> <b><big><a name="Purpose" id="Purpose">Purpose</a></big></b> <br/> This example demonstrates how CppAD can be used in a boost multi-threading environment. <br/> <br/> <b><big><a name="Source Code" id="Source Code">Source Code</a></big></b> <code><font color="blue"> <br/> <pre style='display:inline'> # include <cppad/cppad.hpp> # include <boost/thread.hpp> # define NUMBER_THREADS 4 namespace { // structure with problem specific information typedef struct { // function argument (worker input) double x; // This structure would also have return information in it, // but this example only returns the ok flag } problem_specific; // ===================================================================== // General purpose code you can copy to your application // ===================================================================== using CppAD::thread_alloc; // ------------------------------------------------------------------ // thread specific point to the thread number (initialize as null) void cleanup(size_t*) { return; } boost::thread_specific_ptr<size_t> thread_num_ptr_(cleanup); // Are we in sequential mode; i.e., other threads are waiting for // master thread to set up next job ? bool sequential_execution_ = true; // used to inform CppAD when we are in parallel execution mode bool in_parallel(void) { return ! sequential_execution_; } // used to inform CppAD of current thread number thread_number() size_t thread_number(void) { // return thread_all_[thread_num].thread_num return *thread_num_ptr_.get(); } // --------------------------------------------------------------------- // structure with information for one thread typedef struct { // number for this thread (thread specific points here) size_t thread_num; // pointer to this boost thread boost::thread* bthread; // false if an error occurs, true otherwise bool ok; // pointer to problem specific information problem_specific* info; } thread_one_t; // vector with information for all threads thread_one_t thread_all_[NUMBER_THREADS]; // -------------------------------------------------------------------- // function that initializes the thread and then calls actual worker bool worker(size_t thread_num, problem_specific* info); void run_one_worker(size_t thread_num) { bool ok = true; // The master thread should call worker directly ok &= thread_num != 0; // This is not the master thread, so thread specific infromation // has not yet been set. We use it to inform other routines // of this threads number. // We must do this before calling thread_alloc::thread_num(). thread_num_ptr_.reset(& thread_all_[thread_num].thread_num); // Check the value of thread_alloc::thread_num(). ok = thread_num == thread_alloc::thread_num(); // Now do the work ok &= worker(thread_num, thread_all_[thread_num].info); // pass back ok information for this thread thread_all_[thread_num].ok = ok; // no return value return; } // ---------------------------------------------------------------------- // function that calls all the workers bool run_all_workers(size_t num_threads, problem_specific* info_all[]) { bool ok = true; // initialize thread_all_ (execpt for pthread_id) size_t thread_num; for(thread_num = 0; thread_num < num_threads; thread_num++) { // pointed to by thread specific info for this thread thread_all_[thread_num].thread_num = thread_num; // initialize as false to make sure worker gets called by other // threads. Note that thread_all_[0].ok does not get used thread_all_[thread_num].ok = false; // problem specific information thread_all_[thread_num].info = info_all[thread_num]; } // master bthread number thread_num_ptr_.reset(& thread_all_[0].thread_num); // Now thread_number() has necessary information for this thread // (number zero), and while still in sequential mode, // call setup for using CppAD::<a href="ad.xml" target="_top">AD</a><double> in parallel mode. thread_alloc::parallel_setup( num_threads, in_parallel, thread_number ); thread_alloc::hold_memory(true); CppAD::parallel_ad<double>(); // inform CppAD that we now may be in parallel execution mode sequential_execution_ = false; // This master thread is already running, we need to create // num_threads - 1 more threads thread_all_[0].bthread = CPPAD_NULL; for(thread_num = 1; thread_num < num_threads; thread_num++) { // Create the thread with thread number equal to thread_num thread_all_[thread_num].bthread = new boost::thread(run_one_worker, thread_num); } // now call worker for the master thread thread_num = thread_alloc::thread_num(); ok &= thread_num == 0; ok &= worker(thread_num, thread_all_[thread_num].info); // now wait for the other threads to finish for(thread_num = 1; thread_num < num_threads; thread_num++) { thread_all_[thread_num].bthread->join(); delete thread_all_[thread_num].bthread; thread_all_[thread_num].bthread = CPPAD_NULL; } // Inform CppAD that we now are definately back to sequential mode sequential_execution_ = true; // now inform CppAD that there is only one thread thread_alloc::parallel_setup(1, CPPAD_NULL, CPPAD_NULL); thread_alloc::hold_memory(false); CppAD::parallel_ad<double>(); // check to ok flag returned by during calls to work by other threads for(thread_num = 1; thread_num < num_threads; thread_num++) ok &= thread_all_[thread_num].ok; return ok; } // ===================================================================== // End of General purpose code // ===================================================================== // function that does the work for one thread bool worker(size_t thread_num, problem_specific* info) { bool ok = true; // CppAD::vector uses the CppAD fast multi-threading allocator CppAD::vector< CppAD::<a href="ad.xml" target="_top">AD</a><double> > ax(1), ay(1); ax[0] = info->x; <a href="independent.xml" target="_top">Independent</a>(ax); ay[0] = sqrt( ax[0] * ax[0] ); CppAD::<a href="funconstruct.xml" target="_top">ADFun</a><double> f(ax, ay); // Check function value corresponds to the identity double eps = 10. * CppAD::numeric_limits<double>::epsilon(); ok &= CppAD::<a href="nearequal.xml" target="_top">NearEqual</a>(ay[0], ax[0], eps, eps); // Check derivative value corresponds to the identity. CppAD::vector<double> d_x(1), d_y(1); d_x[0] = 1.; d_y = f.<a href="forward.xml" target="_top">Forward</a>(1, d_x); ok &= CppAD::<a href="nearequal.xml" target="_top">NearEqual</a>(d_x[0], 1., eps, eps); return ok; } } bool simple_ad(void) { bool ok = true; size_t num_threads = NUMBER_THREADS; // Check that no memory is in use or avialable at start // (using thread_alloc in sequential mode) size_t thread_num; for(thread_num = 0; thread_num < num_threads; thread_num++) { ok &= thread_alloc::inuse(thread_num) == 0; ok &= thread_alloc::available(thread_num) == 0; } // initialize info_all problem_specific *info, *info_all[NUMBER_THREADS]; for(thread_num = 0; thread_num < num_threads; thread_num++) { // problem specific information size_t min_bytes(sizeof(info)), cap_bytes; void* v_ptr = thread_alloc::get_memory(min_bytes, cap_bytes); info = static_cast<problem_specific*>(v_ptr); info->x = double(thread_num) + 1.; info_all[thread_num] = info; } ok &= run_all_workers(num_threads, info_all); // go down so that free memory for other threads before memory for master thread_num = num_threads; while(thread_num--) { // delete problem specific information void* v_ptr = static_cast<void*>( info_all[thread_num] ); thread_alloc::return_memory( v_ptr ); // check that there is no longer any memory inuse by this thread ok &= thread_alloc::inuse(thread_num) == 0; // return all memory being held for future use by this thread thread_alloc::free_available(thread_num); } return ok; } </pre> </font></code> <hr/>Input File: multi_thread/bthread/simple_ad_bthread.cpp </body> </html> |